Sciweavers

6142 search results - page 427 / 1229
» The Complexity of Partition Functions
Sort
View
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
15 years 6 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 4 months ago
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
Jin-yi Cai, Sangxia Huang, Pinyan Lu
CCS
2009
ACM
16 years 7 months ago
Semantic context aware security policy deployment
The successful deployment of a security policy is closely related not only to the complexity of the security requirements but also to the capabilities/functionalities of the secur...
Frédéric Cuppens, Joaquín Gar...
DCC
2002
IEEE
16 years 6 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang
FOCS
1998
IEEE
15 years 11 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...