Sciweavers

545 search results - page 22 / 109
» Estimating the Probability of Approximate Matches
Sort
View
ACCV
2007
Springer
15 years 3 months ago
Simultaneous Appearance Modeling and Segmentation for Matching People Under Occlusion
We describe an approach to segmenting foreground regions corresponding to a group of people into individual humans. Given background subtraction and ground plane homography, hierar...
Zhe Lin, Larry S. Davis, David S. Doermann, Daniel...
ICML
2010
IEEE
14 years 10 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
SIAMJO
2008
72views more  SIAMJO 2008»
14 years 9 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
82
Voted
ICRA
1999
IEEE
110views Robotics» more  ICRA 1999»
15 years 1 months ago
Subpixel Localization and Uncertainty Estimation Using Occupancy Grids
We describe techniques for performing mobile robot localization using occupancy grids that allow subpixel localization and uncertainty estimation in the pixelized pose space. The ...
Clark F. Olson