563 search results - page 39 / 113 » Computing approximate PSD factorizations |
SIAMCOMP
2008
13 years 11 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
SDM
2007
SIAM
14 years 17 days ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
ASAP
2009
IEEE
14 years 2 months ago
2009
IEEE
An implementation of a radix-4 approximate squaring circuit is described employing a new operand dual recoding technique. Approximate squaring circuits have numerous applications ...
SIGECOM
2010
ACM
13 years 11 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....