Sciweavers

656 search results - page 90 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
ICALP
2007
Springer
15 years 6 months ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro...
AIS
2004
Springer
15 years 3 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
CVPR
2007
IEEE
16 years 1 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
RECOMB
2004
Springer
16 years 4 days ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
FOCS
2010
IEEE
14 years 9 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan