Sciweavers

389 search results - page 2 / 78
» Advances in Computation of the Maximum of a Set of Random Va...
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 4 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
CVPR
2007
IEEE
14 years 7 months ago
Kernel-based Tracking from a Probabilistic Viewpoint
In this paper, we present a probabilistic formulation of kernel-based tracking methods based upon maximum likelihood estimation. To this end, we view the coordinates for the pixel...
Quang Anh Nguyen, Antonio Robles-Kelly, Chunhua Sh...
CVPR
2008
IEEE
14 years 7 months ago
Structure learning in random fields for heart motion abnormality detection
Coronary Heart Disease can be diagnosed by assessing the regional motion of the heart walls in ultrasound images of the left ventricle. Even for experts, ultrasound images are dif...
Glenn Fung, Kevin Murphy, Mark Schmidt, Róm...
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
13 years 6 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
ICEIS
1999
IEEE
13 years 9 months ago
Contour Estimation on Piecewise Homogeneous Random Fields
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
José A. Moinhos Cordeiro, José M. B....