Sciweavers

3946 search results - page 394 / 790
» The computational complexity of choice sets
Sort
View
BIRTHDAY
2012
Springer
14 years 3 months ago
Deniable RSA Signature - The Raise and Fall of Ali Baba
The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evi...
Serge Vaudenay
BMCBI
2010
170views more  BMCBI 2010»
15 years 7 months ago
Integrative analysis of gene expression and copy number alterations using canonical correlation analysis
Background: With the rapid development of new genetic measurement methods, several types of genetic alterations can be quantified in a high-throughput manner. While the initial fo...
Charlotte Soneson, Henrik Lilljebjörn, Thoas ...
CVPR
2009
IEEE
17 years 2 months ago
SIFT-Rank: Ordinal Description for Invariant Feature Correspondence
This paper investigates ordinal image description for invariant feature correspondence. Ordinal description is a meta-technique which considers image measurements in terms of th...
Matthew Toews, William M. Wells III
ECCV
2008
Springer
16 years 9 months ago
SERBoost: Semi-supervised Boosting with Expectation Regularization
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
Amir Saffari, Helmut Grabner, Horst Bischof
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 9 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo