Sciweavers

1091 search results - page 87 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 8 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
INFOCOM
2012
IEEE
11 years 10 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
CVIU
2010
138views more  CVIU 2010»
13 years 8 months ago
Probabilistic structure matching for visual SLAM with a multi-camera rig
We propose to use a multi-camera rig for simultaneous localization and mapping (SLAM), providing flexibility in sensor placement on mobile robot platforms while exploiting the str...
Michael Kaess, Frank Dellaert
VMV
2000
146views Visualization» more  VMV 2000»
13 years 9 months ago
Matching 3D Freeform Shapes to Digitized Objects
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
Joris S. M. Vergeest, Sander Spanjaard, Jos J. O. ...