Competitive tree-structured dictionaries

13 years 5 months ago

Download www.ics.uci.edu

In this note we describe a general technique for making treestructured dynamic dictionaries adapt to be competitive with the most efficient implementation, by using potential energy parameters and a simple partial rebuilding scheme.

Michael T. Goodrich

Real-time Traffic

Algorithms | Partial Rebuilding Scheme | Potential Energy Parameters | SODA 2000 | Treestructured Dynamic Dictionaries |

claim paper

» High Performance DictionaryBased String Matching for Deep Packet Inspection

» The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Netw...

» ICDAR 2009 Handwriting Recognition Competition

» Proximal Methods for Sparse Hierarchical Dictionary Learning

» Joint learning and dictionary construction for pattern recognition

» A compressed selfindex using a ZivLempel dictionary

» Deletion Without Rebalancing in Balanced Binary Trees

» Evolutionary Induction of Decision Trees for Misclassification Cost Minimization

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Michael T. Goodrich

Comments (0)

Sciweavers

Competitive tree-structured dictionaries

Algorithms | Partial Rebuilding Scheme | Potential Energy Parameters | SODA 2000 | Treestructured Dynamic Dictionaries |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers