Sciweavers

2517 search results - page 420 / 504
» Specifying Weak Sets
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Compositional Boosting for Computing Hierarchical Image Structures
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...
Tianfu Wu, Gui-Song Xia, Song Chun Zhu
ICML
2006
IEEE
16 years 7 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
EUROCRYPT
2009
Springer
16 years 7 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung
PPOPP
2009
ACM
16 years 7 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara
RECOMB
2005
Springer
16 years 6 months ago
Causal Inference of Regulator-Target Pairs by Gene Mapping of Expression Phenotypes
Background: Correlations between polymorphic markers and observed phenotypes provide the basis for mapping traits in quantitative genetics. When the phenotype is gene expression, ...
David Kulp, Manjunatha Jagalur