Sciweavers

85 search results - page 3 / 17
» Scaling limit of random k-trees
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
ECCV
1992
Springer
16 years 8 months ago
Boundary Detection in Piecewise Homogeneous Textured Images
We address the problem of scale selection in texture analysis. Two di erent scale parameters, feature scale and statistical scale, are dened. Statistical scale is the size of the r...
Stefano Casadei, Sanjoy K. Mitter, Pietro Perona
ATAL
2011
Springer
14 years 6 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
IJCV
2012
13 years 8 months ago
Harmony Potentials - Fusing Global and Local Scale for Semantic Image Segmentation
The Hierarchical Conditional Random Field (HCRF) model have been successfully applied to a number of image labeling problems, including image segmentation. However, existing HCRF m...
Xavier Boix, Josep M. Gonfaus, Joost van de Weijer...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar