3510 search results - page 602 / 702 » Searching with numbers |
236
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
224
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
181
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
167
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
165
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...