Sciweavers

621 search results - page 71 / 125
» Parsing As Tree Traversal
Sort
View
RT
1999
Springer
14 years 2 months ago
Interactive Ray-Traced Scene Editing using Ray Segment Trees
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
Kavita Bala, Julie Dorsey, Seth J. Teller
MFCS
1995
Springer
14 years 1 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 4 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
DMKD
2004
ACM
167views Data Mining» more  DMKD 2004»
14 years 3 months ago
FP-tax: tree structure based generalized association rule mining
Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining wit...
Iko Pramudiono, Masaru Kitsuregawa
ICALP
2000
Springer
14 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick