7015 search results - page 249 / 1403 » Approximation algorithms for co-clustering |
179
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
143
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
165
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a new algorithm for approximate joint diagonalization of several symmetric matrices. While it is based on the classical least squares criterion, a novel intrin...
160
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
160
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...