Sciweavers

296 search results - page 30 / 60
» Approximate Discovery of Random Graphs
Sort
View
JMLR
2012
11 years 10 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICPR
2010
IEEE
13 years 6 months ago
3D Vertebrae Segmentation in CT Images with Random Noises
Exposure levels (X-ray tube amperage and peak kilovoltage) are associated with various noise levels and radiation dose. When higher exposure levels are applied, the images have hi...
Melih Seref Aslan
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 16 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau