3341 search results - page 329 / 669 » On Bounded Queries and Approximation |
170
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
165
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
205
click to vote
CASC
2009
Springer
15 years 7 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
205
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...