1632 search results - page 74 / 327 » Sublinear Time Algorithms for Metric Space Problems |
125
Voted
IPL
2010
15 years 1 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
220
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
145
Voted
IPSN
2011
Springer
14 years 7 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...
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
119
Voted
SOFSEM
2010
Springer
16 years 11 days ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...