10890 search results - page 1838 / 2178 » Automatic Complexity Analysis |
183
click to vote
CF
2004
ACM
16 years 2 days ago
2004
ACM
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
154
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
157
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
167
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
183
click to vote
DIALM
2004
ACM
16 years 2 days ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...