Daniel Freedman and Petros Drineas Computer Science Department, Rensselaer...  Home/Search
Context Related
| rpi.edu/~freedd/pu...an_cvpr05cuts.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/~freedd/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was first attacked by two papers of Kolmogorov and Zabih [23, 24], in which they dealt with functions with pairwise and triplewise pixel interactions. In this work, we extend their results in two directions. First, we examine the case of k-wise pixel interactions; the results are derived from a purely algebraic approach.... (Update)
Cited by: More
Segmentation of Neighboring Structures by Modeling Their.. - Yan, Shah (2006) (Correct)
Active bibliography (related documents): More All
2.1: Sampling Sub-problems of Heterogeneous Max-Cut Problems.. - Drineas, Kannan, Mahoney (2004) (Correct)
1.1: Pass-Ecient Algorithms for Approximating Large Matrices - Petros Drine As (Correct)
0.6: Fast Monte Carlo Algorithms for Matrices III: Computing.. - Drineas, Kannan, Mahoney (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
D. Freedman and P. Drineas. Energy minimization via graph cuts: Settling what is possible. In Proc. IEEE Conf. Com- http://citeseer.ist.psu.edu/751203.html More
@misc{ freedman-energy,
author = "D. Freedman and P. Drineas",
title = "Energy minimization via graph cuts: Settling what is possible",
text = "D. Freedman and P. Drineas. Energy minimization via graph cuts: Settling
what is possible. In Proc. IEEE Conf. Com-",
url = "citeseer.ist.psu.edu/751203.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1992
167 Property testing and its connection to learning and approxim.. - Goldreich, Goldwasser et al. - 1996
149 Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al. - 1995
122 Fast approximate energy minimization via graph cuts - Boykov, Veksler et al. - 1999
106 approximation algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
64 The regularity lemma and approximation schemes for dense pro.. (context) - Frieze, Kannan - 1996
51 Quick approximation to matrices and applications - Frieze, Kannan - 1999
42 Monte Carlo Strategies in Scientific Computing (context) - Liu - 2001
40 What energy functions can be minimized via graph cuts - Kolmogorov, Zabih - 2004
40 What energy functions can be minimized via graph cuts - Kolmogorov, Zabih - 2002
36 An application of combinatorial optimization to statistical .. (context) - Barahona, otschel et al. - 1988
33 Multi-camera scene reconstruction via graph cuts - Kolmogorov, Zabih - 2002
13 Maximum cuts and large bipartite subgraphs (context) - Poljak, Tuza - 1995
11 Computing geodesics and minimal surfaces via graph cuts - Boykov, Kolmogorov - 2003
7 MAX-CUT has a randomized approximation scheme in dense graph.. (context) - Vega - 1996
7 Fast Monte Carlo algorithms for matrices I: Approximating ma.. (context) - Drineas, Kannan et al. - 2004
6 Fast Monte Carlo algorithms for matrices III: Computing a co.. - Drineas, Kannan et al. - 2004
6 Fast Monte Carlo algorithms for matrices II: Computing a low.. - Drineas, Kannan et al. - 2004
6 Sampling lower bounds via information theory (context) - Bar-Yossef - 2003
6 The approximability of constraint satisfaction problems - Khanna, Sudan et al. - 1920
6 The Complexity of Massive Data Set Computations (context) - Bar-Yossef - 2002
2 Sampling subproblems of Max-Cut problems and approximation a.. (context) - Drineas, Kannan et al. - 2005
2 A polynomial time approximation scheme for subdense MAX-CUT - Vega, Karpinski - 2002
2 Random sampling and approximation of MAX-CSPs (context) - Alon, Vega et al. - 2003
1 Combinatorial optimization : algorithms and complexity (context) - Lovasz - 1998
1 Soc for Industrial and Applied Math (context) - Papadimitriou, Steiglitz et al. - 1986
Documents on the same site (http://www.cs.rpi.edu/~freedd/publications.html): More
Tracking Objects Using Density Matching and Shape Priors - Zhang, Freedman (2003) (Correct)
Manifold Reconstruction from Unorganized Points - Freedman (Correct)
Efficient Simplicial Reconstructions of Manifolds from their.. - Freedman (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC