7015 search results - page 411 / 1403 » Approximation algorithms for co-clustering |
171
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
197
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
178
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
172
click to vote
JCB
2007
15 years 6 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
194
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...