876 search results - page 17 / 176 » Complexity in geometric SINR |
109
Voted
MOBICOM
2005
ACM
15 years 7 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Nowadays computer graphics hardware presents a series of characteristics, such as AGP memory, vertex cache, etc., that can be used for real-time rendering. The aim of thi...
114
click to vote
IJCGA
2006
15 years 1 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
BIOCOMP
2006
15 years 3 months ago
2006
In healthy eukaryotic cells, mitochondria have an outer membrane that surrounds a complex inner membrane structure [7,8]. Cytochrome c is found in the space between the two membra...
VRML
1997
ACM
15 years 6 months ago
1997
ACM
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...