876 search results - page 130 / 176 » Complexity in geometric SINR |
DCOSS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ASPDAC
2004
ACM
14 years 3 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
ICCS
2004
Springer
14 years 3 months ago
2004
Springer
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...