604 search results - page 28 / 121 » On the Complexity of the Maximum Cut Problem |
SIGECOM
2010
ACM
15 years 1 days 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....
WG
2001
Springer
15 years 4 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...
MVA
1994
15 years 1 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...
VLDB
2005
ACM
15 years 5 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...
WAIM
2007
Springer
15 years 6 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...