7015 search results - page 202 / 1403 » Approximation algorithms for co-clustering |
172
click to vote
CCCG
2007
15 years 8 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
132
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
171
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we propose a symmetrical EEG/fMRI fusion algorithm which combines EEG and fMRI by means of a common generative model. The use of a total variation (TV) prior as wel...
157
click to vote
CGF
2004
15 years 6 months ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
147
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...