Sciweavers

1082 search results - page 87 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ICCV
1999
IEEE
14 years 11 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
DCG
2010
137views more  DCG 2010»
13 years 9 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
DGCI
1999
Springer
14 years 1 months ago
Directional 3D Thinning Using 8 Subiterations
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techn...
Kálmán Palágyi, Attila Kuba
PRL
2008
118views more  PRL 2008»
13 years 8 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
ICML
2003
IEEE
14 years 9 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington