4171 search results - page 676 / 835 » Distributed Data Structure Design for Scientific Computation |
243
click to vote
DIALM
2003
ACM
16 years 3 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
215
click to vote
VALUETOOLS
2006
ACM
16 years 24 days ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
181
Voted
SIGCSE
2004
ACM
16 years 8 days ago
2004
ACM
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
149
click to vote
VLDB
2004
ACM
16 years 5 days ago
2004
ACM
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
184
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...