244 search results - page 10 / 49 » Fast Set Intersection in Memory |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Level set method based segmentation provides an efficient tool for topological and geometrical shape handling. Conventional level set surfaces are only C0 continuous since the le...
ACSC
2003
IEEE
13 years 11 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...