Sciweavers

4137 search results - page 484 / 828
» On the number of matchings of a tree
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 7 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
167
Voted
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
16 years 7 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ICIAP
2001
Springer
16 years 7 months ago
Representing Volumetric Vascular Structures Using Curve Skeletons
This paper describes a technique to represent relevant information of tree-like structures in a compact way. The technique is general. In the application described here, the image...
Gabriella Sanniti di Baja, Ingela Nyström, St...
ICC
2009
IEEE
159views Communications» more  ICC 2009»
16 years 1 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
ICCCN
2008
IEEE
16 years 1 months ago
Inter-Domain Routing Scalability in Optical DWDM Networks
: Recent studies on inter-domain DWDM networks used on topology abstraction for state summarization, i.e., transforming a physical topology to a virtual mesh, tree, or star network...
Qing Liu, Chongyang Xie, Tannous Frangieh, Nasir G...