Sciweavers

1332 search results - page 265 / 267
» Combinatorial Algorithms
Sort
View
TCS
2008
13 years 6 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
JCB
2007
118views more  JCB 2007»
13 years 6 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
TMI
2008
66views more  TMI 2008»
13 years 6 months ago
Feature Normalization via Expectation Maximization and Unsupervised Nonparametric Classification For M-FISH Chromosome Images
Multicolor fluorescence in situ hybridization (M-FISH) techniques provide color karyotyping that allows simultaneous analysis of numerical and structural abnormalities of whole hum...
Hyohoon Choi, Alan C. Bovik, Kenneth R. Castleman
BMCBI
2004
146views more  BMCBI 2004»
13 years 6 months ago
Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data
Background: Functional genomics studies are yielding information about regulatory processes in the cell at an unprecedented scale. In the yeast S. cerevisiae, DNA microarrays have...
Feng Gao, Barrett C. Foat, Harmen J. Bussemaker
IJCM
2002
97views more  IJCM 2002»
13 years 6 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...