7015 search results - page 232 / 1403 » Approximation algorithms for co-clustering |
163
click to vote
AAIM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
184
click to vote
IPL
2002
15 years 6 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
146
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
145
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
161
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...