2430 search results - page 307 / 486 » Computing Tutte Polynomials |
140
Voted
JSAT
2006
15 years 3 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
109
Voted
JSC
2006
15 years 3 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
133
Voted
FUIN
2007
15 years 3 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
120
Voted
AUTOMATICA
2005
15 years 3 months ago
2005
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
117
Voted
TCS
2008
15 years 3 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...