2485 search results - page 114 / 497 » Time Bounded Frequency Computations |
166
click to vote
ASWSD
2004
Springer
15 years 10 months ago
2004
Springer
– A safety-critical real-time computer system must provide its services with a dependability that is much better than the dependability of any one of its constituent components. ...
208
click to vote
ISTCS
1997
Springer
15 years 9 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
176
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
139
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
240
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...