Sciweavers

3055 search results - page 216 / 611
» Randomized Search Trees
Sort
View
ECCV
2006
Springer
16 years 2 months ago
Feature Harvesting for Tracking-by-Detection
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
Mustafa Özuysal, Vincent Lepetit, Franç...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 2 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
98
Voted
EUSFLAT
2007
150views Fuzzy Logic» more  EUSFLAT 2007»
15 years 2 months ago
Competitive Self-adaptation in Evolutionary Algorithms
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
Josef Tvrdík, Ivan Krivý
213
Voted
ICDE
2009
IEEE
245views Database» more  ICDE 2009»
16 years 2 months ago
WISE: A Workflow Information Search Engine
Workflows are widely used for representing business processes, web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for peo...
Qihong Shao, Peng Sun, Yi Chen
ICML
2005
IEEE
16 years 1 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III