Sciweavers

328 search results - page 61 / 66
» An O(log n log log n) space algorithm for undirected st-conn...
Sort
View
MFCS
2009
Springer
14 years 2 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
ICALP
2004
Springer
14 years 26 days ago
The Black-Box Complexity of Nearest Neighbor Search
We deļ¬ne a natural notion of eļ¬ƒciency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
INFOCOM
2008
IEEE
14 years 1 months ago
Reducing Maximum Stretch in Compact Routing
ā€”It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
DAGSTUHL
2006
13 years 9 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 4 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy