948 search results - page 89 / 190 » What can we achieve by arbitrary announcements |
SENSYS
2003
ACM
14 years 2 months ago
2003
ACM
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
APSCC
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...