231 search results - page 26 / 47 » Sublinear time approximate clustering |
212
Voted
SIGMOD
2009
ACM
16 years 21 days ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
199
Voted
SIGMOD
2008
ACM
16 years 19 days ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
101
Voted
WABI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
103
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
115
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...