6110 search results - page 99 / 1222 » Approximate Computing |
193
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
148
click to vote
QUESTA
2007
15 years 5 months ago
2007
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
143
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
144
click to vote
IPL
2010
15 years 4 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
166
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
A general verification algorithm is described. It is then shown how ellipsoidal methods developed by A. B. Kurzhanski and P. Varaiya can be adapted to the algorithm. New numerical ...