• No results found

Space-Time Paths for All Users

Time Interval All Fastest Paths in a Network

Time Interval All Fastest Paths in a Network

... the users’ preferred leaving time does not af- fect the query ...the users to input the day and time of driving. But we all know that during rush hours, inbound highways to big cities ...

10

Paths to Space Settlement

Paths to Space Settlement

... potentially one of, if not the, most environmentally sound large scale energy system. If PowerSats are built from lunar materials, SSP has only two major terrestrial environmental impacts: the antenna and the power beam. ...

14

Recreational pursuits of wheelchair users:  Overcoming time space limitations

Recreational pursuits of wheelchair users: Overcoming time space limitations

... wheelchair users are influenced by what they can do rather than by what they want to ...the time-space environment to provide for free movements of wheelchair ...

14

All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time

All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time

... for all of the points that are at distance no more than ` − 1 from s and that we have a list, called the frontier, containing all of the points being at distance exactly ` − 1 from ...find all points ...

13

All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time

All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time

... for all-pairs approximate shortest paths: As the name suggests, an algorithm for approximate shortest- paths (or distances) would report paths (distances) which are longer than the actual ...

10

The geometry of the space of branched rough paths

The geometry of the space of branched rough paths

... for all k ď ...on all G k pT n q with 1 ď k, n ď N, first by recursion on k for fixed n and then by recursion on n; at each step we enforce the H¨ older continuity on G k pT n q and the compatibility with the ...

32

Optimal Investment For All Time Horizons And Martin Boundary Of Space‐Time Diffusions

Optimal Investment For All Time Horizons And Martin Boundary Of Space‐Time Diffusions

... of all ter- minal payoffs (random variables, or, distributions), which form a complete order : for any given pair of payoffs, the investor either prefers one to the other, or is indifferent between the two ...

36

All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time

All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time

... ) time, where n is the number of vertices and ω is the exponent for matrix multiplication over ...for all pairs of vertices together with a “successor matrix” from which one can extract an explicit maximum ...

17

Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time revisited

Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time revisited

... shortest paths at the cost of an additional factor of log n in the update ...that all shortest paths of the graph have the same number of ...among all shortest paths from s to t is ...

21

All Space Will be Public Space

All Space Will be Public Space

... Let me give you an example: [39 CLICK TO #havingsex TWEET] “That’s silly,” you say. “Sure, there are a few weirdos, but most people won’t be having real-­‐time sex in a networked public.” Not so silly. All ...

9

Modeling all-optical space/time switching fabrics with frame integrity

Modeling all-optical space/time switching fabrics with frame integrity

... By far, the highest amount of traffic generated into the Internet is video content. Video content includes, but is not limited to, peer-to-peer videos, Internet Protocol Television (IPTV), Video on Demand (VoD), and ...

174

Cell Representations of the Configuration Space for Planning Optimal Paths

Cell Representations of the Configuration Space for Planning Optimal Paths

... Some have sought hybrid approaches to combine the benefits of decomposition and sampling-based motion planning. Zhang, Kim, and Manocha’s PRM-augmenting decom- position and Saltzman, Hemmer, Raveh, and Halperin’s ...

18

Calculating least risk paths in 3D indoor space

Calculating least risk paths in 3D indoor space

... Most paths are (almost) similar in length to its shortest path ...correlated paths with very similar path sequences throughout their entire ...rectangle all take the same route for both their least ...

8

“Gotta catch ‘em all” or “not enough time”: Users motivations for playing Pokémon Go and non users reasons for not installing

“Gotta catch ‘em all” or “not enough time”: Users motivations for playing Pokémon Go and non users reasons for not installing

... with time, however respect the fact that others are motivated in fitness as a by-product”, “not interested, I would rather spend my time more constructively training properly rather than walking around with ...

25

Space/time practices and the production of space and time: an introduction

Space/time practices and the production of space and time: an introduction

... especially all the contributors of the present Special Issue for their very construc- tive ...to all the participators of our workshops and other discussion platforms! We also would like to thank the German ...

16

Time and space

Time and space

... how the geometric shapes physically joined together became more important. Thinking of large scale constructions and how the different pieces are all joined together left me with many possibilities to consider. ...

44

A New Approach to Dynamic All Pairs Shortest Paths

A New Approach to Dynamic All Pairs Shortest Paths

... any time t, if shortest paths are unique, then there can be at most n 2 optimal historical ...before time t, and is no longer optimal at time ...historical paths, it is sufficient to ...

29

Time complexity of two disjoint simple paths

Time complexity of two disjoint simple paths

... There is a simple relation between the problems of nding a Hamiltonian path and a Hamiltonian cycle. In one point of view, the Hamiltonian path problem for graph G is equivalent to the Hamiltonian cycle problem in a ...

9

Probability Paths and the Structure of Predictions over Time

Probability Paths and the Structure of Predictions over Time

... common time series modeling tasks, we are not interested in producing a sequence of point estimates for the future probability path {Y } T t=1 , as a model that always outputs the current best probabilistic ...

18

Gotta catch 'em all or not enough time: Users motivations for playing Pokemon Go (TM) and non users' reasons for not installing

Gotta catch 'em all or not enough time: Users motivations for playing Pokemon Go (TM) and non users' reasons for not installing

... differences, time, experience and culture which are key considerations that can thwart motivation and ultimately associated ...some users their motivation clearly reduced over a 3-month period and they ...

10

Show all 10000 documents...

Related subjects