Sciweavers

2370 search results - page 407 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ACL
2011
13 years 18 days ago
Domain Adaptation by Constraining Inter-Domain Variability of Latent Feature Representation
We consider a semi-supervised setting for domain adaptation where only unlabeled data is available for the target domain. One way to tackle this problem is to train a generative m...
Ivan Titov
IBPRIA
2011
Springer
13 years 13 days ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
ICCV
2011
IEEE
12 years 9 months ago
An adaptive coupled-layer visual model for robust visual tracking
This paper addresses the problem of tracking objects which undergo rapid and significant appearance changes. We propose a novel coupled-layer visual model that combines the targe...
Luka Cehovin, Matej Kristan, Ales Leonardis
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 4 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko