Sciweavers

485 search results - page 13 / 97
» Iterative Bounding LAO
Sort
View
IJCAI
2007
14 years 11 months ago
Iterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
Shih-Fen Cheng, Michael P. Wellman
ICCV
2011
IEEE
13 years 10 months ago
HEAT: Iterative Relevance Feedback with One Million Images
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...
Nicolae Suditu, Francois Fleuret
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 4 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
IDEAL
2005
Springer
15 years 3 months ago
Recursive Self-organizing Map as a Contractive Iterative Function System
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
Peter Tiño, Igor Farkas, Jort van Mourik
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 10 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri