Sciweavers

7839 search results - page 181 / 1568
» What's there and what's not
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 9 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
TOG
2012
280views Communications» more  TOG 2012»
13 years 3 months ago
What makes Paris look like Paris?
Given a large repository of geotagged imagery, we seek to automatically find visual elements, e.g. windows, balconies, and street signs, that are most distinctive for a certain g...
Carl Doersch, Saurabh Singh, Abhinav Gupta, Josef ...
ISSTA
2012
ACM
13 years 3 months ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...
CVPR
2012
IEEE
13 years 3 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys