Sciweavers

2080 search results - page 147 / 416
» Measuring empirical computational complexity
Sort
View
127
Voted
ICIP
2002
IEEE
16 years 6 months ago
Face detection using coarse-to-fine support vector classifiers
We describe a new face detection algorithm based on a hierarchy of support vector classifiers (SVMs) designed for efficient computation. The hierarchy serves as a platform for a c...
Hichem Sahbi, Donald Geman, Nozha Boujemaa
STACS
2009
Springer
15 years 11 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
CSE
2009
IEEE
15 years 11 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer
ICS
2005
Tsinghua U.
15 years 10 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
ECCV
2000
Springer
16 years 6 months ago
Divergence-Based Medial Surfaces
The medial surface of a volumetric object is of significant interest for shape analysis. However, its numerical computation can be subtle. Methods based on Voronoi techniques prese...
Sylvain Bouix, Kaleem Siddiqi