2434 search results - page 120 / 487 » Algorithmic Randomness of Closed Sets |
125
Voted
PRL
2007
15 years 3 months ago
2007
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
173
Voted
ECCC
2011
14 years 7 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
149
Voted
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
126
Voted
TIP
2008
15 years 3 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
138
Voted
VLSID
2005
IEEE
15 years 9 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...