Sciweavers

1091 search results - page 91 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
TON
2008
133views more  TON 2008»
13 years 7 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
IPPS
2005
IEEE
14 years 1 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu
ICPR
2006
IEEE
14 years 9 months ago
An integrated Monte Carlo data association framework for multi-object tracking
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
ICDE
2011
IEEE
338views Database» more  ICDE 2011»
12 years 11 months ago
Outlier detection on uncertain data: Objects, instances, and inferences
—This paper studies the problem of outlier detection on uncertain data. We start with a comprehensive model considering both uncertain objects and their instances. An uncertain o...
Bin Jiang, Jian Pei
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 10 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray