Sciweavers

1599 search results - page 143 / 320
» Algorithms for Parity Games
Sort
View
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 10 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 10 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
AAAI
2007
15 years 8 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
JSAC
2008
125views more  JSAC 2008»
15 years 6 months ago
Nonbinary LDPC Coding for Multicarrier Underwater Acoustic Communication
Recently, multicarrier modulation in the form of orthogonal frequency division multiplexing (OFDM) has been shown feasible for underwater acoustic communications via effective algo...
Jie Huang, Shengli Zhou, Peter Willett
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 3 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...