Sciweavers

7742 search results - page 220 / 1549
» The Robustness of Level Sets
Sort
View
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
15 years 6 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
204
Voted
PAMI
2007
217views more  PAMI 2007»
15 years 6 months ago
Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations
—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and li...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
LWA
2008
15 years 8 months ago
On the Topical Structure of the Relevance Feedback Set
We investigate the topical structure of the set of documents used to expand a query in pseudorelevance feedback (PRF). We propose a coherence score to measure the relative topical...
Jiyin He, Martha Larson, Maarten de Rijke
PLDI
2010
ACM
15 years 10 months ago
Evaluating Iterative Optimization across 1000 Data Sets
While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the b...
Yang Chen, Yuanjie Huang, Lieven Eeckhout, Grigori...
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...