1059 search results - page 46 / 212 » Improved Algorithms via Approximations of Probability Distri... |
112
click to vote
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
TNN
1998
14 years 9 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...