Sciweavers

165 search results - page 27 / 33
» Cryptographic Complexity Classes and Computational Intractab...
Sort
View
CVIU
2007
129views more  CVIU 2007»
15 years 3 months ago
Multi-view face and eye detection using discriminant features
Multi-view face detection plays an important role in many applications. This paper presents a statistical learning method to extract features and construct classifiers for multi-...
Peng Wang, Qiang Ji
SSPR
2010
Springer
15 years 2 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
15 years 3 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 11 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
MFCS
2007
Springer
15 years 10 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant