2168 search results - page 402 / 434 » Randomized Algorithms and Complexity Theory |
117
Voted
MM
2004
ACM
15 years 8 months ago
2004
ACM
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
161
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
116
click to vote
JACM
2006
15 years 2 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
148
Voted
ICSM
2008
IEEE
15 years 9 months ago
2008
IEEE
Up-to-date comments are critical for the successful evolution of a software application. When modifying a function, developers may update the comment associated with the function ...
123
click to vote
EUROCAST
2007
Springer
15 years 8 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...