Sciweavers

2594 search results - page 504 / 519
» Elements of a Theory of Simulation
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICDCS
2010
IEEE
15 years 3 months ago
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
Hongyu Zhou, Su Xia, Miao Jin, Hongyi Wu
ICASSP
2009
IEEE
15 years 3 months ago
Optimized opportunistic multicast scheduling (OMS) over heterogeneous cellular networks
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
CCS
2006
ACM
15 years 3 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
ATAL
2003
Springer
15 years 3 months ago
A false-name-proof double auction protocol for arbitrary evaluation values
We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategyproofness...
Yuko Sakurai, Makoto Yokoo