847 search results - page 45 / 170 » Approximation algorithms for projective clustering |
123
Voted
Publication
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
118
click to vote
IPL
2007
15 years 15 days ago
2007
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
111
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
91
Voted
AAMAS
2007
Springer
15 years 22 days ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
78
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...