620 search results - page 79 / 124 » A Simple and Fast Min-cut Algorithm |
NIPS
2008
15 years 1 months ago
2008
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
NIPS
2007
15 years 1 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
NIPS
2000
15 years 1 months ago
2000
An active set strategy is applied to the dual of a simple reformulation of the standard quadratic program of a linear support vector machine. This application generates a fast new...
CG
2007
Springer
14 years 11 months ago
2007
Springer
We present an efficient compression scheme for animated sequences of triangular meshes of the same connectivity. The proposed algorithm exploits the temporal coherence of the geo...
IJON
2006
14 years 11 months ago
2006
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...