Sciweavers

5658 search results - page 23 / 1132
» An Efficient Counting Network
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 11 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
FC
2008
Springer
134views Cryptology» more  FC 2008»
13 years 11 months ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 1 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
NETGAMES
2006
ACM
14 years 3 months ago
Count down protocol: asynchronous consistent protocol in P2P virtual ball game
This paper studies a way to improve consistency of states in a ball game typed DVE with lag, in P2P architecture. We also study how to control shared objects in real-time in a ser...
Yoshihiro Kawano, Tatsuhiro Yonekura
CCR
2002
105views more  CCR 2002»
13 years 9 months ago
Adaptive packet sampling for flow volume measurement
Traffic measurement and monitoring are an important component of network management and traffic engineering. With high-speed Internet backbone links, efficient and effective packe...
Baek-Young Choi, Jaesung Park, Zhi-Li Zhang