336 search results - page 4 / 68 » Analytic Cut Trees |
ESA
2000
Springer
13 years 11 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
TSD
2000
Springer
13 years 11 months ago
2000
Springer
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
CNIS
2006
13 years 9 months ago
2006
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...