Sciweavers

12194 search results - page 2227 / 2439
» cans 2010
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 4 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
16 years 4 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 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
« Prev « First page 2227 / 2439 Last » Next »