Sciweavers

2310 search results - page 179 / 462
» The selection efficiency of tournaments
Sort
View
ET
2000
73views more  ET 2000»
13 years 9 months ago
Deterministic BIST with Partial Scan
An efficient deterministic BIST scheme based on partial scan chains together with a scan selection algorithm tailored for BIST is presented. The algorithm determines a minimum num...
Gundolf Kiefer, Hans-Joachim Wunderlich
JMLR
2010
115views more  JMLR 2010»
13 years 4 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
JMLR
2010
129views more  JMLR 2010»
13 years 4 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 10 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICPR
2006
IEEE
14 years 10 months ago
Adaptive Step Size Window Matching for Detection
An often overlooked problem in matching lies in selecting an appropriate step size. The selection of the step size for real-time applications is critical both from the point of vi...
Nathan Mekuz, Konstantinos G. Derpanis, John K. Ts...