Sciweavers

999 search results - page 163 / 200
» Finding shapes in a set of points
Sort
View
65
Voted
ICML
2003
IEEE
15 years 10 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
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 4 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
106
Voted
DAGSTUHL
2006
14 years 11 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
87
Voted
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
15 years 11 months ago
Topologically Clean Distance Fields
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
Attila G. Gyulassy, Mark A. Duchaineau, Vijay Na...
PR
2008
218views more  PR 2008»
14 years 9 months ago
Automatic feature localisation with constrained local models
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
David Cristinacce, Timothy F. Cootes