Sciweavers

1071 search results - page 41 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
APAL
2010
124views more  APAL 2010»
13 years 8 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
BMCBI
2007
169views more  BMCBI 2007»
13 years 8 months ago
Transcriptional regulatory network refinement and quantification through kinetic modeling, gene expression microarray data and i
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
Abdallah Sayyed-Ahmad, Kagan Tuncay, Peter J. Orto...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 8 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
ATAL
2007
Springer
14 years 2 months ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser
LREC
2010
197views Education» more  LREC 2010»
13 years 9 months ago
Automatic Annotation of Co-Occurrence Relations
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
Dirk Goldhahn, Uwe Quasthoff