Sciweavers

233 search results - page 3 / 47
» Learning Regular Expressions from Noisy Sequences
Sort
View
CSL
2007
Springer
14 years 5 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
MM
2009
ACM
277views Multimedia» more  MM 2009»
14 years 5 months ago
Inferring semantic concepts from community-contributed images and noisy tags
In this paper, we exploit the problem of inferring images’ semantic concepts from community-contributed images and their associated noisy tags. To infer the concepts more accura...
Jinhui Tang, Shuicheng Yan, Richang Hong, Guo-Jun ...
JCB
2007
130views more  JCB 2007»
13 years 10 months ago
Bayesian Inference of MicroRNA Targets from Sequence and Expression Data
MicroRNAs (miRNAs) regulate a large proportion of mammalian genes by hybridizing to targeted messenger RNAs (mRNAs) and down-regulating their translation into protein. Although mu...
Jim C. Huang, Quaid Morris, Brendan J. Frey
ICML
2001
IEEE
14 years 11 months ago
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
Wenxin Jiang
RECOMB
2002
Springer
14 years 11 months ago
From promoter sequence to expression: a probabilistic framework
We present a probabilistic framework that models the process by which transcriptional binding explains the mRNA expression of different genes. Our joint probabilistic model unifie...
Eran Segal, Yoseph Barash, Itamar Simon, Nir Fried...