Sciweavers

43 search results - page 7 / 9
» Hierarchical In-Network Data Aggregation with Quality Guaran...
Sort
View
IPSN
2007
Springer
13 years 12 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
GIS
2010
ACM
13 years 3 months ago
Using location based social networks for quality-aware participatory data transfer
The sensing systems that monitor physical environments rely on communication infrastructures (wired or wireless) to collect data from the sensors embedded in the environment. Howe...
Houtan Shirani-Mehr, Farnoush Banaei Kashani, Cyru...
TON
1998
71views more  TON 1998»
13 years 5 months ago
Real-time block transfer under a link-sharing hierarchy
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
Geoffrey G. Xie, Simon S. Lam
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
14 years 5 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
PAMI
2008
152views more  PAMI 2008»
13 years 5 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet