604 search results - page 97 / 121 » On the Complexity of the Maximum Cut Problem |
110
click to vote
WWW
2008
ACM
16 years 15 days ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
ISORC
2009
IEEE
15 years 6 months ago
2009
IEEE
Distributed real-time automotive embedded systems have to be highly dependable as well as cost-efficient due to the large number of manufactured units. To close the gap between r...
113
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
127
click to vote
AIIDE
2009
15 years 28 days ago
2009
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...
116
click to vote
SAC
2008
ACM
14 years 11 months ago
2008
ACM
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...