Sciweavers

630 search results - page 65 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
TIP
2010
151views more  TIP 2010»
14 years 4 months ago
Camera Scheduling and Energy Allocation for Lifetime Maximization in User-Centric Visual Sensor Networks
We explore camera scheduling and energy allocation strategies for lifetime optimization in image sensor networks. For the application scenarios that we consider, visual coverage ov...
Chao Yu, Gaurav Sharma
COMPGEOM
2010
ACM
15 years 2 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
COMPGEOM
2010
ACM
15 years 2 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
INFOCOM
2012
IEEE
13 years 8 days ago
Scaling social media applications into geo-distributed clouds
—Federation of geo-distributed cloud services is a trend in cloud computing which, by spanning multiple data centers at different geographical locations, can provide a cloud plat...
Yu Wu, Chuan Wu, Bo Li 0001, Linquan Zhang, Zongpe...
LCN
2007
IEEE
15 years 4 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo