130 search results - page 12 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
FGCN
2007
IEEE
14 years 1 months ago
2007
IEEE
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...