7015 search results - page 421 / 1403 » Approximation algorithms for co-clustering |
173
click to vote
FOCM
2002
15 years 6 months ago
2002
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
165
click to vote
TCS
2010
15 years 5 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
181
click to vote
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
167
click to vote
TNN
1998
15 years 6 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
167
click to vote
GECCO
2004
Springer
16 years 7 days ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...