316 search results - page 45 / 64 » On Approximate Majority and Probabilistic Time |
96
Voted
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Volumetric structures are frequently used as shape descriptors for 3D data. The capture of such data is being facilitated by developments in multi-view video and range sc...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
SCCC
1997
IEEE
15 years 1 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
KDD
1997
ACM
15 years 1 months ago
1997
ACM
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...