Sciweavers

3422 search results - page 583 / 685
» Random Subset Optimization
Sort
View
117
Voted
ICML
2008
IEEE
16 years 3 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
130
Voted
ISBI
2004
IEEE
16 years 3 months ago
Vascular Segmentation in Three-Dimensional Rotational Angiography Based on Maximum Intensity Projections
Three-dimensional rotational angiography (3D-RA) is a relatively new and promising technique for imaging blood vessels. In this paper, we propose a novel 3D-RA vascular segmentati...
Rui Gan, Albert C. S. Chung, Wilbur C. K. Wong, Si...
ICLP
2009
Springer
16 years 3 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
107
Voted
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 3 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
115
Voted
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 3 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong