Sciweavers

2069 search results - page 91 / 414
» Linear time algorithms for Clobber
Sort
View
PAMI
2010
245views more  PAMI 2010»
15 years 2 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
ICALP
2005
Springer
15 years 9 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 3 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
ESANN
2006
15 years 5 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
15 years 8 months ago
Benchmarking sep-CMA-ES on the BBOB-2009 noisy testbed
A partly time and space linear CMA-ES is benchmarked on the BBOB-2009 noisy function testbed. This algorithm with a multistart strategy with increasing population size solves 10 f...
Raymond Ros