Sciweavers

1221 search results - page 77 / 245
» Two Consistency Results on Set Mappings
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 6 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
ICCV
2011
IEEE
14 years 4 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
CP
2005
Springer
15 years 11 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
ICCVW
1999
Springer
15 years 10 months ago
An Experimental Comparison of Stereo Algorithms
While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using r...
Richard Szeliski, Ramin Zabih