"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."

Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.

"... 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 machine-learning method that applies text-categorization techniques to just the ..."

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 cross-sentence contextual constraints. Publication info: Proceedings of the ACL, 2004. 1

"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."

"... The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds ..."

The notion of (circular) colorings of edge-weightedgraphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds

"... Abstract. Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonnegative weights in R. Using this generalization, we provide an independent proof of a Riemann-Ro ..."

Abstract. Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonnegative weights in R. Using this generalization, we provide an independent proof of a Riemann

"... A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is ∑ w(e). We show that the edges of every graph that e∋v does not contain a component isomorphic to K2 can be weighted from the set {1,...,30} such that in the resulting vertex ..."

A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is ∑ w(e). We show that the edges of every graph that e∋v does not contain a component isomorphic to K2 can be weighted from the set {1,...,30} such that in the resulting

"... Given a graph G = (V,E) and a weight function w: E → R, a coloring of vertices of G, induced by w, is defined by χw(v) = e3v w(e) for all v ∈ V. In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP-com ..."

Given a graph G = (V,E) and a weight function w: E → R, a coloring of vertices of G, induced by w, is defined by χw(v) = e3v w(e) for all v ∈ V. In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP

"... Many application domains suffer from not having enough labeled training data for learning. However, large amounts of unlabeled examples can often be gathered cheaply. As a result, there has been a great deal of work in recent years on how unlabeled data can be used to aid classification. We consi ..."