1136 search results - page 190 / 228 » Finding Small Holes |
226
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
200
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
253
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
253
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
129
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...