Sciweavers

17541 search results - page 3424 / 3509
» Complexity in scalable computing
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
PLDI
2010
ACM
15 years 2 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 2 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
TAMC
2010
Springer
15 years 2 months ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
TRUST
2010
Springer
15 years 2 months ago
Beyond Kernel-Level Integrity Measurement: Enabling Remote Attestation for the Android Platform
Abstract. Increasing adoption of smartphones in recent times has begun to attract more and more malware writers towards these devices. Among the most prominent and widely adopted o...
Mohammad Nauman, Sohail Khan, Xinwen Zhang, Jean-P...
« Prev « First page 3424 / 3509 Last » Next »