Sciweavers

1508 search results - page 137 / 302
» Efficient Path Profiling
Sort
View
WIDM
2004
ACM
15 years 4 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
15 years 1 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling
DAC
2001
ACM
16 years 9 days ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
15 years 3 months ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
DASFAA
2009
IEEE
147views Database» more  DASFAA 2009»
15 years 3 months ago
MCN: A New Semantics Towards Effective XML Keyword Search
We investigate the expressiveness of existing XML keyword search semantics and propose Meaningful Connected Network (MCN) as a new semantics to capture meaningful relationships of ...
Junfeng Zhou, Zhifeng Bao, Tok Wang Ling, Xiaofeng...