817 search results - page 66 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
159
Voted
AMDO
2010
Springer
15 years 28 days ago
2010
Springer
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...
132
Voted
ALGOSENSORS
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
153
Voted
VMV
2001
15 years 4 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
126
click to vote
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
127
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...