Sciweavers

1434 search results - page 179 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CCS
2010
ACM
15 years 3 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
EMNLP
2009
15 years 1 days ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
113
Voted
ICDCS
2007
IEEE
15 years 8 months ago
A Weighted Moving Average-based Approach for Cleaning Sensor Data
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is ...
Yongzhen Zhuang, Lei Chen 0002, Xiaoyang Sean Wang...
HIPC
2007
Springer
15 years 8 months ago
Experiments with a Parallel External Memory System
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
Mohammad R. Nikseresht, David A. Hutchinson, Anil ...