Sciweavers

385 search results - page 53 / 77
» Contour Approximation in Sensor Networks
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
15 years 11 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
INFOCOM
2007
IEEE
15 years 3 months ago
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
Junhua Zhu, Shan Chen, Brahim Bensaou, Ka-Lok Hung
88
Voted
ICASSP
2010
IEEE
14 years 9 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
DC
2008
14 years 9 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 9 months ago
Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case
Abstract-- Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor net...
Zichong Chen, Guillermo Barrenetxea, Martin Vetter...