Sciweavers

475 search results - page 86 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
JCST
2008
120views more  JCST 2008»
13 years 7 months ago
Generic Transformation from Weakly to Strongly Unforgeable Signatures
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
Qiong Huang, Duncan S. Wong, Jin Li, Yiming Zhao
ECCV
2004
Springer
14 years 9 months ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
ETVC
2008
13 years 9 months ago
Sparse Multiscale Patches for Image Processing
Abstract. This paper presents a framework to define an objective measure of the similarity (or dissimilarity) between two images for image processing. The problem is twofold: 1) de...
Paolo Piro, Sandrine Anthoine, Eric Debreuve, Mich...
BMCBI
2008
168views more  BMCBI 2008»
13 years 7 months ago
Predicting protein folding pathways at the mesoscopic level based on native interactions between secondary structure elements
Background: Since experimental determination of protein folding pathways remains difficult, computational techniques are often used to simulate protein folding. Most current techn...
Qingwu Yang, Sing-Hoi Sze
OPODIS
2010
13 years 5 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...