2463 search results - page 348 / 493 » Compressing Pattern Databases |
KDD
2009
ACM
14 years 10 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
DEXAW
2008
IEEE
14 years 4 months ago
2008
IEEE
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
DASFAA
2005
IEEE
14 years 3 months ago
2005
IEEE
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...