3341 search results - page 93 / 669 » On Bounded Queries and Approximation |
191
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
101
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
COLT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
JMLR
2002
14 years 9 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...