Sciweavers

394 search results - page 67 / 79
» Practically Coordinating
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
15 years 11 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
15 years 9 months ago
Locating Mapped Resources in Web 2.0
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
Anthony K. H. Tung, Beng Chin Ooi, Dongxiang Zhang
MOBIHOC
2005
ACM
15 years 9 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MOBIHOC
2005
ACM
15 years 9 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
INFOCOM
2009
IEEE
15 years 4 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...