<--- Back to Details
First PageDocument Content
Computing / Computer programming / Suffix tree / Succinct data structure / Rope / Entropy / Information theory / Koorde / Segment tree / Data structures / Binary trees / Information
Date: 2006-02-14 10:47:14
Computing
Computer programming
Suffix tree
Succinct data structure
Rope
Entropy
Information theory
Koorde
Segment tree
Data structures
Binary trees
Information

Add to Reading List

Source URL: www.dmi.unisa.it

Download Document from Source Website

File Size: 215,09 KB

Share Document on Facebook

Similar Documents

Algebra / Mathematics / Polynomials / Abstract algebra / Polynomial / Irreducible polynomial / Factorization of polynomials / Resultant / Algebraic geometry / Factorization / Polynomial greatest common divisor / Permutation polynomial

LibPoly: A Library for Reasoning about Polynomials∗ Dejan Jovanovi´c and Bruno Dutertre SRI International Abstract LibPoly is a C library for computing with polynomials. It provides data structures to represent multiv

DocID: 1xUTX - View Document

Cybernetics / Computing / Technology / Software engineering / Computational neuroscience / International Conference on Machine Learning / Outline of machine learning / Machine learning / Haskell / University of California /  Riverside / Artificial intelligence

Mike Izbicki About Me My research makes machine learning algorithms faster. I’ve developed improved data structures for nearest neighbor queries and faster distributed learning procedures. I use techniques from high di

DocID: 1xTYW - View Document

Network performance / Information and communications technology / Deep packet inspection / Computing / Net neutrality / Broadband / Network management / Data transmission / Procera Networks / Data cap / Capacity management / Bandwidth management

Use Cases Procera Networks: Find . See . Do . More Procera Networks structures mobile and fixed broadband network data, transforming it into

DocID: 1xTU8 - View Document

Software engineering / Computer programming / Programming language theory / Compiler optimizations / Control flow / Loop optimization / Heap / Optimizing compiler / Foreach loop

Static Detection of Loop-Invariant Data Structures Guoqing Xu1 , Dacong Yan2 , and Atanas Rountev2 1 2 University of California, Irvine, CA, USA

DocID: 1xTMY - View Document

Fair Synchronization∗ Gadi Taubenfeld† June 30, 2016 Abstract Most published concurrent data structures which avoid locking do not provide any fairness guarantees. That is, they allow processes to access a data struc

DocID: 1vnGU - View Document