104 search results - page 18 / 21 » Dependency trees in sub-linear time and bounded memory |
3DIM
2005
IEEE
15 years 5 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
SIGMETRICS
1997
ACM
15 years 3 months ago
1997
ACM
In this paper we present a performance study of memory reference behavior in network protocol processing, using an Internet-based protocol stack implemented in the x-kernel runnin...
105
click to vote
JCSS
2008
14 years 11 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...