Sciweavers

1985 search results - page 213 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
CVPR
2005
IEEE
16 years 6 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
CVPR
2007
IEEE
16 years 6 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
LOCA
2009
Springer
15 years 10 months ago
Location Diversity: Enhanced Privacy Protection in Location Based Services
Abstract. Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Locationbased Services to protect privacy, by hiding t...
Mingqiang Xue, Panos Kalnis, Hung Keng Pung
ICASSP
2011
IEEE
14 years 7 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...