Sciweavers

1712 search results - page 62 / 343
» A Computational Approach to Binding Theory
Sort
View
CORR
1998
Springer
85views Education» more  CORR 1998»
14 years 11 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen
RECOMB
2004
Springer
16 years 5 days ago
Predicting Genetic Regulatory Response Using Classification: Yeast Stress Response
We present a novel classification-based algorithm called GeneClass for learning to predict gene regulatory response. Our approach is motivated by the hypothesis that in simple orga...
Manuel Middendorf, Anshul Kundaje, Chris Wiggins, ...
BMCBI
2008
172views more  BMCBI 2008»
14 years 12 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 4 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ECCV
2002
Springer
16 years 1 months ago
A Markov Chain Monte Carlo Approach to Stereovision
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
Julien Sénégas