7015 search results - page 295 / 1403 » Approximation algorithms for co-clustering |
163
click to vote
IPMU
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
147
click to vote
UAI
2004
15 years 8 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
184
click to vote
TEC
2002
15 years 6 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
194
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
185
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...