Sciweavers

1859 search results - page 92 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 5 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
CVPR
2008
IEEE
16 years 7 months ago
On the use of independent tasks for face recognition
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary...
Àgata Lapedriza, David Masip, Jordi Vitri&a...
HCI
2009
15 years 2 months ago
Long Term Repair of Learning Disability through Short-Term Reduction of CNS Inhibition
Learning disabilities are serious societal problems contributing to a loss of quality of life for affected individuals and their families. We hypothesized that the learning disabil...
H. Craig Heller, Damien Colas, Norman F. Ruby, Fab...
BMCBI
2007
145views more  BMCBI 2007»
15 years 4 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
ECCV
2006
Springer
16 years 6 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...