Sciweavers

4124 search results - page 164 / 825
» Improved Algorithms for Data Migration
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 3 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
15 years 10 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
126
Voted
DAWAK
2004
Springer
15 years 7 months ago
Space-Efficient Range-Sum Queries in OLAP
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
Fredrik Bengtsson, Jingsen Chen
121
Voted
TC
2008
15 years 3 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
161
Voted
TVCG
2011
188views more  TVCG 2011»
14 years 10 months ago
Data-Parallel Octrees for Surface Reconstruction
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...
Kun Zhou, Minmin Gong, Xin Huang, Baining Guo