Sciweavers

4934 search results - page 155 / 987
» complexity 2008
Sort
View
193
Voted
STAIRS
2008
175views Education» more  STAIRS 2008»
15 years 5 months ago
Learning Process Behavior with EDY: an Experimental Analysis
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
Ugo Galassi
ECCC
2008
79views more  ECCC 2008»
15 years 4 months ago
Valiant-Vazirani Lemmata for Various Logics
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
Moritz Müller
DEBU
1999
85views more  DEBU 1999»
15 years 4 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
COLING
2008
15 years 5 months ago
Scaling up Analogical Learning
Recent years have witnessed a growing interest in analogical learning for NLP applications. If the principle of analogical learning is quite simple, it does involve complex steps ...
Philippe Langlais, François Yvon
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
15 years 4 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia