7015 search results - page 371 / 1403 » Approximation algorithms for co-clustering |
169
click to vote
CGF
2005
15 years 6 months ago
2005
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
205
click to vote
PE
2010
Springer
15 years 5 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
190
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
160
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
190
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...