6251 search results - page 4 / 1251 » Randomness, Computability, and Density |
ADHOCNOW
2004
Springer
14 years 26 days ago
2004
Springer
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
BCS
2008
13 years 9 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...