Sciweavers

749 search results - page 30 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ACL
2009
13 years 7 months ago
Parsing Speech Repair without Specialized Grammar Symbols
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
Tim Miller, Luan Nguyen, William Schuler
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 4 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
ALMOB
2006
138views more  ALMOB 2006»
13 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
IJCAI
2007
13 years 11 months ago
A Bayesian Computational Cognitive Model
Computational cognitive modeling has recently emerged as one of the hottest issues in the AI area. Both symbolic approaches and connectionist approaches present their merits and d...
Zhiwei Shi, Hong Hu, Zhongzhi Shi
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter