7930 search results - page 32 / 1586 » Greedy in Approximation Algorithms |
114
Voted
SGP
2003
15 years 3 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
167
click to vote
CVPR
2011
IEEE
15 years 5 hour ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
112
click to vote
NPC
2005
Springer
15 years 8 months ago
2005
Springer
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
134
click to vote
ICCNMC
2005
Springer
15 years 8 months ago
2005
Springer
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
100
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...