4320 search results - page 666 / 864 » Functional Objects |
169
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
173
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
164
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
170
click to vote
BMVC
2001
15 years 9 months ago
2001
This paper describes an algorithm for shape estimation in cluttered scenes. A new image potential is defined based on strokes detected in the image. The motivation is simple. Fea...
135
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...