Sciweavers

3208 search results - page 256 / 642
» A Lower Bound for Primality
Sort
View
171
Voted
COCOON
2009
Springer
16 years 1 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
IWCMC
2009
ACM
16 years 1 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
ICC
2008
IEEE
139views Communications» more  ICC 2008»
16 years 1 months ago
Performance Limits of Time Synchronization in Wireless Sensor Networks
—We propose a new approach to evaluate the ultimate performance limit of time synchronization in wireless sensor networks based on the estimation theory. In particular the lower ...
Stefano Severi, Davide Dardari
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
16 years 24 days ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
PODC
2006
ACM
16 years 18 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer