11395 search results - page 1978 / 2279 » Beyond computer science |
180
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
178
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
172
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
145
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
199
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...