Sciweavers

7264 search results - page 506 / 1453
» A multiplicative up-propagation algorithm
Sort
View
COLT
1993
Springer
15 years 11 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
DIS
2006
Springer
15 years 10 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...
CCCG
2008
15 years 8 months ago
The Embroidery Problem
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
BIRTHDAY
2009
Springer
16 years 1 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
IROS
2009
IEEE
261views Robotics» more  IROS 2009»
16 years 1 months ago
Probabilistic motion planning among moving obstacles following typical motion patterns
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...
Chiara Fulgenzi, Anne Spalanzani, Christian Laugie...