Sciweavers

658 search results - page 95 / 132
» Lower bounds for sorting networks
Sort
View
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 2 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch
MOBICOM
2009
ACM
14 years 2 months ago
Achievable throughput of multiple access spectrum systems based on cognitive relay
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
Wei Wang, Baochun Li, Li Yu
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 2 months ago
Analysis of a General Mixed Strategy for Gaussian Multiple Relay Channels
— In their landmark paper Cover and El Gamal proposed different coding strategies for the relay channel with a single relay supporting a communication pair. These strategies are ...
Peter Rost, Gerhard Fettweis
TALG
2011
98views more  TALG 2011»
13 years 2 months ago
Tree exploration with logarithmic memory
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
Christoph Ambühl, Leszek Gasieniec, Andrzej P...