10146 search results - page 312 / 2030 » Fast FAST |
147
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
158
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
122
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
158
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
142
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...