Results 1  10
of
2,188
A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts
 PROCEEDINGS OF THE ACL
, 2004
"... Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as “thumbs up” or “thumbs down”. To determine this sentiment polarity, we propose a novel machinelearning method that applies textcategorization techniques to just the ..."
Abstract

Cited by 618 (7 self)
 Add to MetaCart
the subjective portions of the document. Extracting these portions can be implemented using efficient techniques for finding minimum cuts in graphs; this greatly facilitates incorporation of crosssentence contextual constraints.
An NC Algorithm for Minimum Cuts
 IN PROCEEDINGS OF THE 25TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
"... We show that the minimum cut problem for weighted undirected graphs can be solved in NC using three separate and independently interesting results. The first is an (m 2 =n)processor NC algorithm for finding a (2 + ffl)approximation to the minimum cut. The second is a randomized reduction from ..."
Abstract

Cited by 55 (4 self)
 Add to MetaCart
We show that the minimum cut problem for weighted undirected graphs can be solved in NC using three separate and independently interesting results. The first is an (m 2 =n)processor NC algorithm for finding a (2 + ffl)approximation to the minimum cut. The second is a randomized reduction
Minimum cuts in nearlinear time
 Proc. of the 28th STOC
, 1996
"... Abstract. We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carl ..."
Abstract

Cited by 95 (12 self)
 Add to MetaCart
Abstract. We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte
Multicriteria global minimum cuts
 In Proceedings of the 15th International Symposium on Algorithms and Complexity (ISAAC 2004), Hong Kong, China, LNCS 3341
, 2004
"... We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the kcriteria setting, each edge of the input graph has k nonnegative costs associated with it. These costs are measured in separate, non interchangeable, units. In the ANDversion of the problem, pur ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the kcriteria setting, each edge of the input graph has k nonnegative costs associated with it. These costs are measured in separate, non interchangeable, units. In the ANDversion of the problem
Graph clustering and minimum cut trees
 INTERNET MATHEMATICS
, 2004
"... In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are general enough to apply to any kind of graph but are well suited for graphs where the link structure implies a notion of reference, similarity, or endorsement, such as web ..."
Abstract

Cited by 71 (4 self)
 Add to MetaCart
In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are general enough to apply to any kind of graph but are well suited for graphs where the link structure implies a notion of reference, similarity, or endorsement
Distributed Minimum Cut Approximation
"... We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized approximation algorithms that both run in a standard synchronous message passing model where in each round, O(log n) bits can be transmitted over every edge (a.k.a. the CONGEST model) ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized approximation algorithms that both run in a standard synchronous message passing model where in each round, O(log n) bits can be transmitted over every edge (a.k.a. the CONGEST model
On MAXSAT and Minimum Cut
"... Many optimization problems can be easily expressed in propositional logic, as a set of clauses, each with a cost if it is unsatisfied. We observe that a minimumcut problem so expressed can be solved via a randomized unitclauseelimination algorithm that is isomorphic to Karger's random cont ..."
Abstract
 Add to MetaCart
Many optimization problems can be easily expressed in propositional logic, as a set of clauses, each with a cost if it is unsatisfied. We observe that a minimumcut problem so expressed can be solved via a randomized unitclauseelimination algorithm that is isomorphic to Karger's random
Experimental Study of Minimum Cut Algorithms
 PROCEEDINGS OF THE EIGHTH ANNUAL ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA)
, 1997
"... Recently, several new algorithms have been developed for the minimum cut problem. These algorithms are very different from the earlier ones and from each other and substantially improve worstcase time bounds for the problem. We conduct experimental evaluation the relative performance of these algor ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
Recently, several new algorithms have been developed for the minimum cut problem. These algorithms are very different from the earlier ones and from each other and substantially improve worstcase time bounds for the problem. We conduct experimental evaluation the relative performance
Results 1  10
of
2,188