2127 search results - page 33 / 426 » Computing large matchings fast |
123
click to vote
NIPS
2001
15 years 4 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
123
Voted
KES
2004
Springer
15 years 8 months ago
2004
Springer
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
146
click to vote
GD
2000
Springer
15 years 7 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
135
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
The rapid revolution in microprocessor chip architecture due to multicore technology is presenting unprecedented challenges to the application developers as well as system softwar...
115
Voted
EUROGRAPHICS
2010
Eurographics
16 years 14 days ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...