Sciweavers

34 search results - page 5 / 7
» A new approximation algorithm for labeling points with circl...
Sort
View
ICML
2003
IEEE
14 years 7 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
PEPM
1995
ACM
13 years 9 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 29 days ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ICCV
1998
IEEE
14 years 8 months ago
Recognition of Plane Projective Symmetry
A novel approach to grouping symmetrical planar curves under a projective transform is described. Symmetric curves are important as a generic model for object recognition where an...
Rupert W. Curwen, Charles V. Stewart, Joseph L. Mu...
JMLR
2008
100views more  JMLR 2008»
13 years 6 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori