604 search results - page 28 / 121 » On the Complexity of the Maximum Cut Problem |
152
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
170
click to vote
WG
2001
Springer
15 years 10 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
118
click to vote
MVA
1994
15 years 7 months ago
1994
Lace is liable to stretch as it is passed through the feed mechanism, in which a vision system is engaged to detect the changes of the motif and find the cutting path (river) acro...
133
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
144
click to vote
WAIM
2007
Springer
15 years 11 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...