Sciweavers

333 search results - page 48 / 67
» Speeding up moving-target search
Sort
View
80
Voted
ICIP
2009
IEEE
15 years 11 months ago
Early Terminating Algorithms For Adaboost Based Detectors
In this paper we propose an early termination algorithm for speeding up the detection phase of the Adaboost based detectors. In the basic algorithm, at a specific search location,...
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
15 years 10 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
15 years 7 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
15 years 5 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule
59
Voted
ICPR
2008
IEEE
15 years 4 months ago
Adaptive selection of non-target cluster centers for K-means tracker
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
Hiroshi Oike, Haiyuan Wu, Toshikazu Wada