Sciweavers

5372 search results - page 97 / 1075
» complexity 2007
Sort
View
AI
2007
Springer
14 years 2 months ago
Rethinking the Semantics of Complex Nominals
Complex Nominals (CNs) have simple syntactic structure that conceals non-trivial semantic characteristics. While speakers of natural languages combine noun(s)/adjective(s) with a h...
Nabil Abdullah, Richard A. Frost
AIIA
2007
Springer
14 years 1 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 1 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
CONCUR
2007
Springer
14 years 1 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson