Sciweavers

32 search results - page 2 / 7
» Complexity of Unification in Free Groups and Free Semi-group...
Sort
View
ACL
1997
13 years 6 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
BMCBI
2008
130views more  BMCBI 2008»
13 years 5 months ago
FAF-Drugs2: Free ADME/tox filtering tool to assist drug discovery and chemical biology projects
Background: Drug discovery and chemical biology are exceedingly complex and demanding enterprises. In recent years there are been increasing awareness about the importance of pred...
David Lagorce, Olivier Sperandio, Hervé Gal...
BMCBI
2005
97views more  BMCBI 2005»
13 years 5 months ago
The yeast kinome displays scale free topology with functional hub clusters
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
Robin E. C. Lee, Lynn A. Megeney
ACL
1989
13 years 6 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
ECAI
2010
Springer
13 years 6 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...