Sciweavers

1284 search results - page 109 / 257
» Data Structures for Mergeable Trees
Sort
View
APVIS
2009
13 years 8 months ago
A self-adaptive treemap-based technique for visualizing hierarchical data in 3D
In this paper, we present a novel adaptive visualization technique where the constituting polygons dynamically change their geometry and other visual attributes depending on user ...
Abon Chaudhuri, Han-Wei Shen
PVLDB
2010
136views more  PVLDB 2010»
13 years 6 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 10 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ISNN
2005
Springer
14 years 1 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
13 years 12 months ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail