Sciweavers

248 search results - page 38 / 50
» Geometrical Probability Covering Algorithm
Sort
View
NIPS
2000
13 years 8 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
SCHOLARPEDIA
2008
89views more  SCHOLARPEDIA 2008»
13 years 5 months ago
Support vector clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur
ICPR
2006
IEEE
14 years 8 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
CIVR
2008
Springer
114views Image Analysis» more  CIVR 2008»
13 years 9 months ago
World-scale mining of objects and events from community photo collections
In this paper, we describe an approach for mining images of objects (such as touristic sights) from community photo collections in an unsupervised fashion. Our approach relies on ...
Till Quack, Bastian Leibe, Luc J. Van Gool