2796 search results - page 58 / 560 » The coolest path problem |
ADT
2010
14 years 10 months ago
2010
Abstract In this survey, the currently available ultrawideband-based non-line-of-sight (NLOS) identification and error mitigation methods are presented. They are classified into se...
COMPGEOM
1999
ACM
15 years 4 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
115
click to vote
IPSN
2011
Springer
14 years 3 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
104
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...