5138 search results - page 467 / 1028 » Randomized Algorithms for 3-SAT |
188
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
293
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
170
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
167
click to vote
APPROX
2004
Springer
16 years 8 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
180
click to vote
ESA
2003
Springer
16 years 3 days ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...