Sciweavers

666 search results - page 35 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 7 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 8 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
ICDM
2006
IEEE
107views Data Mining» more  ICDM 2006»
14 years 2 months ago
Improving Grouped-Entity Resolution Using Quasi-Cliques
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
Byung-Won On, Ergin Elmacioglu, Dongwon Lee, Jaewo...
ECML
1991
Springer
14 years 12 days ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
EUROSPI
2005
Springer
14 years 2 months ago
Framework of Agile Patterns
The variety of agile methods and their similarity could be a problem for software engineers to select a single or a number of methods and to properly execute them in a project. A p...
Teodora Bozheva, Maria Elisa Gallo