336 search results - page 51 / 68 » Effective Randomness for Computable Probability Measures |
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...
ADHOC
2011
13 years 2 months ago
2011
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...