2740 search results - page 139 / 548 » Approximating Component Selection |
161
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
110
click to vote
RANDOM
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
159
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
146
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We address the problem of estimating human body pose from a single image with cluttered background. We train multiple local linear regressors for estimating the 3D pose f...
138
click to vote
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...