Sciweavers

580 search results - page 101 / 116
» Choosing a random peer
Sort
View
NETGAMES
2006
ACM
14 years 1 months ago
Cheat detection for MMORPG on P2P environments
In recent years, MMORPG has become popular. In order to improve scalability of game system, several P2P-based architectures have been proposed. However, in P2P-based gaming archit...
Takato Izaiku, Shinya Yamamoto, Yoshihiro Murata, ...
ICIP
2003
IEEE
14 years 9 months ago
Watermarking with knowledge of image database
The goal of this paper is to study how a-prior knowledge of the image database could be exploited for better watermarking performance. Unlike most formulations, where the encoder ...
S. Roy, E.-C. Chang
EUROCRYPT
2009
Springer
14 years 8 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 7 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 1 months ago
Impatient Backoff Algorithm: Fairness in a Distributed Ad-Hoc MAC
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
Rajarshi Gupta, Jean C. Walrand