Sciweavers

437 search results - page 82 / 88
» Exploiting design information to derive object distribution ...
Sort
View
MOBIHOC
2004
ACM
14 years 6 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
SIGCOMM
2004
ACM
14 years 4 days ago
Vivaldi: a decentralized network coordinate system
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
Frank Dabek, Russ Cox, M. Frans Kaashoek, Robert M...
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 20 days ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
13 years 6 months ago
Leveraging spatio-temporal redundancy for RFID data cleansing
Radio Frequency Identification (RFID) technologies are used in many applications for data collection. However, raw RFID readings are usually of low quality and may contain many an...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang, Min-Te Su...
SENSYS
2003
ACM
13 years 12 months ago
On the scaling laws of dense wireless sensor networks
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 ...
Praveen Kumar Gopala, Hesham El Gamal