1806 search results - page 175 / 362 » Some Functions Computable with a Fused-Mac |
197
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
179
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
166
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
176
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
175
click to vote
SCALESPACE
2007
Springer
16 years 18 days ago
2007
Springer
A variational formulation of an image analysis problem has the nice feature that it is often easier to predict the eect of minimizing a certain energy functional than to interpret...