Sciweavers

99 search results - page 14 / 20
» On a subclass of close-to-convex functions
Sort
View
CVPR
2000
IEEE
16 years 3 months ago
Towards Automatic Discovery of Object Categories
We propose a method to learn heterogeneous models of object classes for visual recognition. The training images contain a preponderance of clutter and learning is unsupervised. Ou...
Markus Weber, Max Welling, Pietro Perona
77
Voted
CSL
2007
Springer
15 years 7 months ago
Relativizing Small Complexity Classes and Their Theories
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
Klaus Aehlig, Stephen Cook, Phuong Nguyen
COLT
2006
Springer
15 years 5 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
SIROCCO
2001
15 years 2 months ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro
PAMI
2011
14 years 8 months ago
Kernel Optimization in Discriminant Analysis
— Kernel mapping is one of the most used approaches to intrinsically derive nonlinear classifiers. The idea is to use a kernel function which maps the original nonlinearly separ...
Di You, Onur C. Hamsici, Aleix M. Martínez