4114 search results - page 58 / 823 » Efficient Algorithms for the 2-Center Problems |
130
click to vote
CCR
2008
15 years 4 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
125
click to vote
MVA
1998
15 years 5 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
123
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
139
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
175
click to vote
ACST
2006
15 years 5 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...