847 search results - page 80 / 170 » Approximation algorithms for projective clustering |
96
Voted
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
98
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
123
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
114
Voted
SIGMOD
2002
ACM
16 years 25 days ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
137
click to vote
TKDE
2012
13 years 3 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...