1220 search results - page 120 / 244 » Restricting grammatical complexity |
110
click to vote
PRESENCE
2002
15 years 2 months ago
2002
"It / I" is a two-character theater play where the human character I (played by a real actor) is taunted and played with by an autonomous computer character It on a comp...
171
click to vote
RECOMB
2010
Springer
15 years 1 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
122
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
104
click to vote
LPAR
2010
Springer
15 years 25 days ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
107
click to vote
NAACL
2010
15 years 25 days ago
2010
With the increase in popularity of online review sites comes a corresponding need for tools capable of extracting the information most important to the user from the plain text da...