Sciweavers

770 search results - page 100 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
IJCV
2007
157views more  IJCV 2007»
14 years 9 months ago
Recovering Surface Layout from an Image
Humans have an amazing ability to instantly grasp the overall 3D structure of a scene – ground orientation, relative positions of major landmarks, etc – even from a single ima...
Derek Hoiem, Alexei A. Efros, Martial Hebert
FOCS
2009
IEEE
15 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ICCV
1999
IEEE
15 years 11 months ago
Finding People by Sampling
We show how to use a sampling method to find sparsely clad people in static images. People are modeled as an assembly of nine cylindrical segments. Segments are found using an EM ...
Sergey Ioffe, David A. Forsyth
IJAR
2007
96views more  IJAR 2007»
14 years 9 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
NIPS
2003
14 years 11 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan