Sciweavers

2356 search results - page 292 / 472
» Characterizations of postman sets
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
16 years 21 hour ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
SENSYS
2003
ACM
15 years 11 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
EUROCRYPT
2003
Springer
15 years 11 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
IWCMC
2010
ACM
15 years 11 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
ICALP
2010
Springer
15 years 11 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie