3227 search results - page 230 / 646 » Designing with Distance Fields |
106
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
123
Voted
MDM
2010
Springer
15 years 5 months ago
2010
Springer
—Range query processing is an important technology in spatial databases. Current studies mainly focus on range queries in outdoor space based on the Euclidean or network distance...
166
Voted
ICCCN
1998
IEEE
15 years 5 months ago
1998
IEEE
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for a...
106
Voted
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
79
Voted
ESCIENCE
2006
IEEE
15 years 4 months ago
2006
IEEE
The necessity of a lab course on computer security arises from the students' need to complement course work by hands-on experience. In order to meet the distance teaching dem...