2492 search results - page 205 / 499 » On the General Signature Trees |
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
162
click to vote
SIROCCO
2004
15 years 8 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
185
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
124
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft? SQL ServerTM. ORDPATH labels nodes of an XML tree without requ...
163
click to vote
ACL
2000
15 years 8 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...