4841 search results - page 182 / 969 » On dynamic feature location |
228
Voted
IJFCS
2002
15 years 6 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
218
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Human saccade is a dynamic process of information pursuit. Based on the principle of information maximization, we propose a computational model to simulate human saccadic scanpath...
188
click to vote
APCSAC
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract. Post-link and dynamic optimizations have become important to achieve program performance. A major challenge in post-link and dynamic optimizations is the acquisition of r...
213
Voted
TPDS
2008
15 years 7 months ago
2008
It has been discussed in the literature that the mobility of a mobile sensor network (MSN) can be used to improve its sensing coverage. How the mobility can efficiently be managed ...
176
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...