4850 search results - page 59 / 970 » Approximate Data Structures with Applications |
114
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
NIPS
2001
14 years 11 months ago
2001
Massive transaction data sets are recorded in a routine manner in telecommunications, retail commerce, and Web site management. In this paper we address the problem of inferring p...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
SAC
2012
ACM
13 years 5 months ago
2012
ACM
Data cloning method is a new computational tool for computing maximum likelihood estimates in complex statistical models such as mixed models. This method is synthesized with inte...
233
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The scope of the well-known k-means algorithm has been
broadly extended with some recent results: first, the k-
means++ initialization method gives some approximation
guarantees...