Sciweavers

709 search results - page 53 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
DAGSTUHL
2007
15 years 2 months ago
Uniqueness of Optimal Mod 3 Circuits for Parity
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
Frederic Green, Amitabha Roy
CAGD
2008
98views more  CAGD 2008»
15 years 1 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
ATAL
2011
Springer
14 years 1 months ago
Concise characteristic function representations in coalitional games based on agent types
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makot...
IACR
2011
141views more  IACR 2011»
14 years 1 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 3 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou