Sciweavers

2430 search results - page 109 / 486
» Computing Tutte Polynomials
Sort
View
135
Voted
JAT
2010
77views more  JAT 2010»
15 years 3 months ago
Quadrature formula for computed tomography
We give a bivariate analog of the Micchelli-Rivlin quadrature for computing the integral of a function over the unit disk using its Radon projections. AMS subject classification:...
Borislav Bojanov, Guergana Petrova
141
Voted
JSC
2010
99views more  JSC 2010»
15 years 3 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
177
Voted
ACL
1990
15 years 6 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
109
Voted
NA
2010
95views more  NA 2010»
14 years 11 months ago
A new algorithm for computing the Geronimus transformation with large shifts
Abstract A monic Jacobi matrix is a tridiagonal matrix which contains the parameters of the three-term recurrence relation satisfied by the sequence of monic polynomials orthogonal...
Maria Isabel Bueno Cachadina, Alfredo Deaño...
ICML
1999
IEEE
16 years 5 months 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