2107 search results - page 117 / 422 » Computing Small Search Numbers in Linear Time |
122
Voted
SODA
1996
ACM
15 years 4 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
130
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
124
Voted
ILP
2004
Springer
15 years 8 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
153
Voted
IEEEPACT
1997
IEEE
15 years 7 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
140
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...