Sciweavers

25 search results - page 3 / 5
» Complexity Results on Balanced Context-Free Languages
Sort
View
FLAIRS
2003
13 years 7 months ago
On the Computational Complexity of Spatio-Temporal Logics
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
David Gabelaia, Roman Kontchakov, Agi Kurucz, Fran...
JMLR
2010
192views more  JMLR 2010»
13 years 1 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater
ACL
2007
13 years 7 months ago
Mildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
Marco Kuhlmann, Mathias Möhl
IPPS
2000
IEEE
13 years 10 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
COMPSAC
2002
IEEE
13 years 11 months ago
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
Robert John Walters