Sciweavers

4934 search results - page 59 / 987
» complexity 2008
Sort
View
143
Voted
DAM
1999
99views more  DAM 1999»
15 years 3 months ago
Recognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
Wilfried Imrich, Sandi Klavzar
LREC
2008
95views Education» more  LREC 2008»
15 years 5 months ago
In Contrast - A Complex Discourse Connective
This paper presents a corpus-based study of the discourse connective in contrast. The corpus data are drawn from the British National Corpus (BNC) and are analyzed at the levels o...
Erhard W. Hinrichs, Monica Lau
138
Voted
COLING
1996
15 years 5 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
120
Voted
ENTCS
2008
91views more  ENTCS 2008»
15 years 3 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
IJAR
2008
108views more  IJAR 2008»
15 years 3 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson