Sciweavers

5377 search results - page 998 / 1076
» Programming Languages For Interactive Computing
Sort
View
CP
2007
Springer
16 years 1 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
FROCOS
2007
Springer
16 years 1 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
ICALP
2007
Springer
16 years 1 months ago
Low Distortion Spanners
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...
Seth Pettie
ICALP
2007
Springer
16 years 1 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
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 ...
Sudipto Guha, Andrew McGregor
ICALP
2007
Springer
16 years 1 months ago
Approximation by DNF: Examples and Counterexamples
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
Ryan O'Donnell, Karl Wimmer