The top documents tagged [node q]

DSF

1 Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach Jiaheng Lu, Ting Chen, Tok Wang Ling National University of.

On Boosting Holism in XML Twig Pattern Matching Using Two Data Streaming Techniques Presenter: Lu Jiaheng Supervisor: Prof. Ling Tok Wang Joint work: Chen.

Balanced Search Trees Robert Tarjan, Princeton University & HP Labs (Joint work with Bernhard Haeupler and Siddhartha Sen)

Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance [1] Pirooz Chubak May 22, 2008.

Splay Trees Binary search trees. Search, insert, delete, and split have amortized complexity O(log n) & actual complexity O(n). Actual and amortized complexity.

Ch6

Selective watchdog technique for intrusion detection in mobile ad hoc network

BINARY SEARCH TREE

UNCLASSIFIED © 2011 Carnegie Mellon University Building Malware Infection Trees Jose Andre Morales 1, Michael Main 2, Weilang Luo 3, Shouhuai Xu 2,3, Ravi.

Discrete Optimization in Computer Vision Nikos Komodakis Ecole des Ponts ParisTech, LIGM Traitement de l’information et vision artificielle.

Shivkumar Kalyanaraman 1 Reference: IS-IS vs OSPF Shivkumar Kalyanaraman Rensselaer Polytechnic Institute [email protected] Abstracted from NANOG talks.