Sciweavers

302 search results - page 37 / 61
» Asymptotic performance of distributed detection over random ...
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
TMI
2002
113views more  TMI 2002»
13 years 7 months ago
Spatiotemporal reconstruction of list mode PET data
We describe a method for computing a continuous time estimate of tracer density using list-mode positron emission tomography data. The rate function in each voxel is modeled as an ...
Thomas E. Nichols, Jinyi Qi, Evren Asma, Richard M...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
MSWIM
2004
ACM
14 years 23 days ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
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, ...