2969 search results - page 467 / 594 » A space efficient algorithm for group structure computation |
173
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
154
click to vote
SPIRE
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
171
click to vote
CCS
2007
ACM
16 years 18 days ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
251
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
175
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...