Sciweavers

402 search results - page 65 / 81
» Achieving privacy in mesh networks
Sort
View
DIM
2007
ACM
14 years 29 days ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
BROADNETS
2007
IEEE
14 years 3 months ago
High-speed wireless backbones: measurements from MagNets
— The long-standing vision of ubiquitous Internet access requires high-speed wireless networks that sustain 100 Mbps or more. While existing hardware already supports these speed...
Alessio Botta, Antonio Pescapè, Giorgio Ven...
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
14 years 3 months ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 11 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
14 years 3 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt