7930 search results - page 317 / 1586 » Greedy in Approximation Algorithms |
108
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
162
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
150
click to vote
ESA
2004
Springer
16 years 1 days ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
152
click to vote
CMMR
2003
Springer
15 years 12 months ago
2003
Springer
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...
187
click to vote
ADHOC
2005
15 years 6 months ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...