Sciweavers

500 search results - page 64 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
PAMI
2010
190views more  PAMI 2010»
13 years 6 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
COMPGEOM
2009
ACM
14 years 2 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
Chuanjiang Luo, Jian Sun, Yusu Wang
TR
2008
117views more  TR 2008»
13 years 7 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
PRIB
2010
Springer
242views Bioinformatics» more  PRIB 2010»
13 years 6 months ago
Consensus of Ambiguity: Theory and Application of Active Learning for Biomedical Image Analysis
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...
Scott Doyle, Anant Madabhushi
LATIN
2010
Springer
13 years 6 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen