14 search results - page 1 / 3 » Fast computing reachability labelings for large graphs with ... |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
SIGMOD
2011
ACM
12 years 7 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
DCC
2002
IEEE
14 years 4 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...