Sciweavers

2520 search results - page 210 / 504
» The complexity of approximating entropy
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
On efficient soft-input soft-output encoding of convolutional codes
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
Andreas Winkelbauer, Gerald Matz
MOBIHOC
2008
ACM
16 years 5 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 10 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
EDBT
2009
ACM
119views Database» more  EDBT 2009»
15 years 9 months ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
AAAI
2007
15 years 8 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch