Sciweavers

405 search results - page 45 / 81
» Random Number Selection in Self-assembly
Sort
View
SSPR
1998
Springer
14 years 1 months ago
Distribution Free Decomposition of Multivariate Data
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
Dorin Comaniciu, Peter Meer
GRAPHICSINTERFACE
2007
13 years 10 months ago
Optimized tile-based texture synthesis
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of t...
Weiming Dong, Ning Zhou, Jean-Claude Paul
NIPS
2008
13 years 10 months ago
Resolution Limits of Sparse Coding in High Dimensions
This paper addresses the problem of sparsity pattern detection for unknown ksparse n-dimensional signals observed through m noisy, random linear measurements. Sparsity pattern rec...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
TIT
2002
102views more  TIT 2002»
13 years 8 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
11 years 11 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant