7015 search results - page 357 / 1403 » Approximation algorithms for co-clustering |
204
click to vote
CGF
2010
15 years 4 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
153
click to vote
AAIM
2007
Springer
16 years 28 days ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
168
click to vote
COCOON
2005
Springer
16 years 9 days ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
156
click to vote
ISAAC
2005
Springer
16 years 7 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
170
click to vote
CAIP
2007
Springer
15 years 10 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...