Sciweavers

210 search results - page 29 / 42
» A Formal Theory of Key Conjuring
Sort
View
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 10 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
ACL
1994
15 years 5 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
STACS
1993
Springer
15 years 8 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
JNCA
2007
69views more  JNCA 2007»
15 years 4 months ago
Specifying the intertwining of cooperation and autonomy in agent-based systems
Cooperation and autonomy are two antagonistic core variables of agent-based systems, and a key challenge in designing such systems is to balance these variables appropriately. Thi...
Gerhard Weiß, Matthias Nickles, Michael Rova...
BMCBI
2007
166views more  BMCBI 2007»
15 years 4 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour