3096 search results - page 180 / 620 » Theory and Use of the EM Algorithm |
149
click to vote
TOC
2008
15 years 5 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
171
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
141
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
149
click to vote
PDCN
2004
15 years 6 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
166
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...