Sciweavers

1018 search results - page 158 / 204
» Generative unbinding of names
Sort
View
AI
2005
Springer
13 years 9 months ago
Learning to talk about events from narrated video in a construction grammar framework
The current research presents a system that learns to understand object names, spatial relation terms and event descriptions from observing narrated action sequences. The system e...
Peter Ford Dominey, Jean-David Boucher
TCBB
2008
116views more  TCBB 2008»
13 years 9 months ago
Inferring Connectivity of Genetic Regulatory Networks Using Information-Theoretic Criteria
Recently, the concept of mutual information has been proposed for inferring the structure of genetic regulatory networks from gene expression profiling. After analyzing the limitat...
Wentao Zhao, Erchin Serpedin, Edward R. Dougherty
BMCBI
2005
114views more  BMCBI 2005»
13 years 9 months ago
AutoFACT: An Automatic Functional Annotation and Classification Tool
Background: Assignment of function to new molecular sequence data is an essential step in genomics projects. The usual process involves similarity searches of a given sequence aga...
Liisa B. Koski, Michael W. Gray, B. Franz Lang, Ge...
AEI
2002
106views more  AEI 2002»
13 years 9 months ago
A functional concept ontology and its application to automatic identification of functional structures
Functionality of artifacts as well as structure and behavior plays crucial roles in problem-solving such as design. This article discusses automatic identifications of functional s...
Yoshinobu Kitamura, Toshinobu Sano, Kouji Namba, R...
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 9 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...