4095 search results - page 316 / 819 » How to test a tree |
176
click to vote
WG
1995
Springer
15 years 9 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
152
click to vote
AIIDE
2008
15 years 7 months ago
2008
Dialogue in commercial games is largely created by teams of writers and designers who hand-author every line of dialogue and hand-specify the dialogue structure using finite state...
141
click to vote
ACL
2004
15 years 7 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
136
click to vote
FLAIRS
2004
15 years 7 months ago
2004
The Federal Highway Administration (FHWA) Office of Highway Planning requires states to furnish vehicle classification data as part of the Highway Performance Monitoring Systems (...
137
click to vote
ALENEX
2003
15 years 7 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...