Sciweavers

270 search results - page 38 / 54
» Generation From Under - And Overspecified Structures
Sort
View
ACL
1997
14 years 11 months ago
Deriving Verbal and Compositional Lexical Aspect for NLP Applications
Verbal and compositional lexical aspect provide the underlying temporal structure of events. Knowledge of lexical aspect, e.g., (a)telicity, is therefore required for interpreting...
Bonnie J. Dorr, Mari Broman Olsen
74
Voted
IJRR
2008
186views more  IJRR 2008»
14 years 9 months ago
Automated Design of Adaptive Controllers for Modular Robots using Reinforcement Learning
Designing distributed controllers for self-reconfiguring modular robots has been consistently challenging. We have developed a reinforcement learning approach which can be used bo...
Paulina Varshavskaya, Leslie Pack Kaelbling, Danie...
COLING
1996
14 years 10 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
BMCBI
2010
214views more  BMCBI 2010»
14 years 9 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
85
Voted
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don