683 search results - page 41 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
NIPS
2004
13 years 9 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
WSC
2004
13 years 9 months ago
2004
This paper describes the application of data farming techniques (Brandstein and Horne 1998) to explore various aspects of coevolutionary dynamics (McKelvey 2002) in organization s...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...