Sciweavers

1456 search results - page 64 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
PAMI
2010
207views more  PAMI 2010»
14 years 6 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
CVPR
2008
IEEE
16 years 1 months ago
Latent topic random fields: Learning using a taxonomy of labels
An important problem in image labeling concerns learning with images labeled at varying levels of specificity. We propose an approach that can incorporate images with labels drawn...
Xuming He, Richard S. Zemel
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
15 years 4 months ago
An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Pete...
ICSE
2007
IEEE-ACM
15 years 11 months ago
Feedback-Directed Random Test Generation
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
Carlos Pacheco, Shuvendu K. Lahiri, Michael D. Ern...