3415 search results - page 278 / 683 » Lower bounds on kernelization |
187
click to vote
IWCMC
2009
ACM
16 years 1 months ago
2009
ACM
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 ...
190
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
—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 ...
192
click to vote
ESCAPE
2007
Springer
16 years 26 days ago
2007
Springer
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 ...
192
click to vote
PODC
2006
ACM
16 years 20 days ago
2006
ACM
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...
185
click to vote
SPAA
2006
ACM
16 years 20 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...