Sciweavers

4095 search results - page 235 / 819
» How to test a tree
Sort
View
JCO
2010
67views more  JCO 2010»
14 years 11 months ago
Galaxy cutsets in graphs
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Nicolas Sonnerat, Adrian Vetta
212
Voted
GIS
2005
ACM
16 years 1 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
SCAM
2007
IEEE
15 years 6 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
103
Voted
ICLP
2005
Springer
15 years 6 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
15 years 6 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar