2944 search results - page 405 / 589 » Improving Bound Propagation |
207
click to vote
CCCG
2006
15 years 8 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
153
click to vote
CCCG
2006
15 years 8 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
149
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
169
click to vote
UAI
2003
15 years 8 months ago
2003
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
187
click to vote
ACL
1996
15 years 7 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...