Oblivious data structure - PDFSEARCH.IO - Document Search Engine

Oblivious data structure
Results: 10

#	Item
1	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-02-07 15:14:45 Analysis of algorithms Computational complexity theory Time complexity Computer science Algorithm Mathematics Academia Oblivious data structure
2	Faster Cover Trees Mike Izbicki Christian Shelton University of California Riverside, 900 University Ave, Riverside, CAAbstract Add to Reading List Source URL: rlair.cs.ucr.edu Language: English - Date: 2015-05-27 17:50:32 Computer programming Computing Learning Machine learning Binary trees K-d tree R-tree Nearest neighbor search Oblivious data structure Cover tree T-tree B-tree
3	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set
4	Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:56 Analysis of algorithms Time complexity Sorting algorithm Algorithm Randomized algorithm NC Big O notation Best worst and average case B-tree Soft heap Oblivious data structure
5	1. IntroductionA C M Student Award Paper: Second Place Multidimensional Add to Reading List Source URL: www.geog.ucsb.edu Language: English - Date: 2013-05-14 18:54:11 Binary trees Data types Tree traversal B-tree Tree Rope K-d tree Binary search tree Oblivious data structure Interval tree
6	Five Balltree Construction Algorithms STEPHEN M. OMOHUNDRO International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, California 94704 Add to Reading List Source URL: www.geog.ucsb.edu Language: English - Date: 2013-05-14 18:54:19 Data types Machine learning B-tree Ball tree K-d tree Binary tree Tree Interval tree Oblivious data structure
7	Towards Optimal Synchronous Counting Christoph Lenzen Joel Rybicki Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:10 Combinatorial optimization Routing algorithms Search algorithms A* search algorithm Game artificial intelligence Consensus Polynomial interpolation Oblivious data structure
8	TOP-K Projection Queries for Probabilistic Business Processes Daniel Deutch Tova Milo {danielde,milo}@cs.tau.ac.il Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2008-08-14 18:13:40 Routing algorithms Search algorithms Combinatorial optimization Flow network Operations research A* search algorithm Tree Oblivious data structure
9	The Fallacy of Composition of Oblivious RAM and Searchable Encryption Muhammad Naveed University of Illinois at Urbana-Champaign ABSTRACT Oblivious RAM (ORAM) is a tool proposed to hide access pattern leakage, and there Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-07-05 14:57:39 Analysis of algorithms Cache Oblivious ram Search engine indexing Oblivious data structure Keyword Computer science Computing
10	Resizable Tree-Based Oblivious RAM Tarik Moataz1,∗,§ , Travis Mayberry2,§ , Erik-Oliver Blass3 , and Agnes Hui Chan2 1 2 Add to Reading List Source URL: fc15.ifca.ai Language: English - Date: 2015-01-11 00:33:32 Binary trees B-tree Computing Analysis of algorithms Cache Oblivious ram Computer science Rope T-tree Computer programming Oblivious data structure