Sciweavers

893 search results - page 153 / 179
» Descent Theory for Schemes
Sort
View
EUROCRYPT
2007
Springer
15 years 6 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
INFOCOM
2006
IEEE
15 years 5 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
MMSEC
2006
ACM
195views Multimedia» more  MMSEC 2006»
15 years 5 months ago
Image annotation watermarking: nested object embedding using hypergraph model
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...
Claus Vielhauer, Maik Schott
PODC
2006
ACM
15 years 5 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
SENSYS
2005
ACM
15 years 5 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...