Sciweavers

1477 search results - page 152 / 296
» Random Convex Programs
Sort
View
102
Voted
AAAI
2008
15 years 4 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
LICS
2002
IEEE
15 years 7 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
132
Voted
ICCV
2009
IEEE
16 years 7 months ago
A Global Perspective on MAP Inference for Low-Level Vision
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for low-level vision applications. However, in a maximum a posteriori (MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...
124
Voted
CVPR
2004
IEEE
16 years 4 months ago
Shape Representation and Classification Using the Poisson Equation
Silhouettes contain rich information about the shape of objects that can be used for recognition and classification. We present a novel approach that allows us to reliably compute...
Lena Gorelick, Meirav Galun, Eitan Sharon, Ronen B...