Sciweavers

15485 search results - page 234 / 3097
» Computing Optimal Subsets
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell
RECOMB
2002
Springer
16 years 6 months ago
Inferring Piecewise Ancestral History from Haploid Sequences
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
Russell Schwartz, Andrew G. Clark, Sorin Istrail
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
STACS
2010
Springer
16 years 1 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
SAC
2009
ACM
16 years 1 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang