Sciweavers

7006 search results - page 982 / 1402
» Approximation Algorithms
Sort
View
JMLR
2012
13 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
NECO
2007
127views more  NECO 2007»
15 years 6 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
CVPR
2007
IEEE
16 years 8 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
FOCS
2008
IEEE
16 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...