Sciweavers

6894 search results - page 367 / 1379
» Generation Problems
Sort
View
COLING
1992
15 years 8 months ago
On the Satisfiability of Complex Constraints
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
Luís Damas, Giovanni B. Varile
JSYML
2008
66views more  JSYML 2008»
15 years 6 months ago
Flat algebras and the translation of universal Horn logic to equational logic
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
Marcel Jackson
CG
1998
Springer
15 years 6 months ago
Visualizing chemical data in the internet - data-driven and interactive graphics
Chemisty faces interesting problems with regard to internet-based information visualization, especially in the context of digital library documents with multimedia components. We ...
Wolf-Dietrich Ihlenfeldt, Klaus Engel
COMBINATORICS
1999
87views more  COMBINATORICS 1999»
15 years 6 months ago
Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion
An asymptotic estimate is given for the coefficients of products of large powers of generating functions. This theorem and another local limit theorem which is useful for conditio...
Edward A. Bender, L. Bruce Richmond
COMCOM
1999
124views more  COMCOM 1999»
15 years 6 months ago
Minimizing the Cost of Fault Location when Testing from a Finite State Machine
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al...
Robert M. Hierons