1802 search results - page 249 / 361 » Complexity Theory for Operators in Analysis |
154
click to vote
COMPGEOM
2004
ACM
15 years 11 months 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...
164
click to vote
COMPGEOM
2004
ACM
15 years 11 months 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...
181
click to vote
DIALM
2004
ACM
15 years 11 months 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 ...
188
click to vote
MOBICOM
2004
ACM
15 years 11 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
148
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...