7015 search results - page 183 / 1403 » Approximation algorithms for co-clustering |
142
click to vote
WAW
2007
Springer
15 years 9 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
126
click to vote
AUSAI
2005
Springer
15 years 8 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
154
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
137
click to vote
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
129
click to vote
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...