2969 search results - page 31 / 594 » A space efficient algorithm for group structure computation |
123
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
138
click to vote
DKE
2008
15 years 3 months ago
2008
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
104
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
123
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
108
click to vote
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...