Sciweavers

69 search results - page 4 / 14
» Generic Incremental Algorithms for Local Search
Sort
View
ECCV
2004
Springer
15 years 22 days ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
SETN
2004
Springer
14 years 4 months ago
Incremental Mixture Learning for Clustering Discrete Data
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
Konstantinos Blekas, Aristidis Likas
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
14 years 2 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
14 years 5 months ago
Incremental Subspace Clustering over Multiple Data Streams
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
Qi Zhang, Jinze Liu, Wei Wang 0010
BMCBI
2010
116views more  BMCBI 2010»
13 years 11 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel