Sciweavers

1368 search results - page 55 / 274
» Generalized Rook Polynomials
Sort
View
COMBINATORICS
2006
101views more  COMBINATORICS 2006»
14 years 12 months ago
Optimal Penney Ante Strategy via Correlation Polynomial Identities
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
Daniel Felix
CG
2002
Springer
14 years 11 months ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
DAC
2011
ACM
13 years 11 months ago
Fast non-monte-carlo transient noise analysis for high-precision analog/RF circuits by stochastic orthogonal polynomials
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
Fang Gong, Hao Yu, Lei He
ICML
1999
IEEE
16 years 20 days ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
CSR
2007
Springer
15 years 6 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen