Study
lib
Documents
Flashcards
Chrome extension
Login
Upload document
Create flashcards
×
Login
Flashcards
Collections
Documents
Last activity
My documents
Saved documents
Profile
Foreign Language
Math
Science
Social Science
Business
Engineering & Technology
Arts & Humanities
History
Miscellaneous
Standardized tests
Engineering & Technology
Computer Science
Data Structures
BFS & DFS Algorithms
Better I/O Through Byte-Addressable, Persistent Memory Jeremy Condit Edmund B. Nightingale Christopher Frost
AlgoVision Requirements
AlgorithmsNotesForProfessionals
Algorithms Developed by Applying Design
ADTs for Algorithm Design ADTs for Algorithm Design Efficiently
A new type of mass structured data duplicate data check
A Key-based Adaptive Transactional Memory Executor March 2007
A Configurable and Extensible Transport Protocol , Member, IEEE , Fellow, IEEE
A Computational Model for the Alignment of
Automatically GIS Updating from Classified Satellite Images Using GIS ... Mathias J.P.M. Lemmens, Koldo F. Verheij
AUTOMATIC SETUP SELECTION AND OPERATION SEQUENCING
AUTOMATIC ROAD EXTRACTION FROM DENSE URBAN AREA BY INTEGRATED
Authentication of Freshness for Outsourced Multi-Version Key-Value Stores Regular paper Yuzhe Tang
Asynchronous Assertions Edward E. Aftandilian Samuel Z. Guyer Martin Vechev
Artificial Intelligence
Arrays I Handling lists of data CMSC 104 1
Approximating Frequent Items in Asynchronous Data Stream over a
Administrative L13: Review for Midterm 3/19/09
Anonymous Class in Declarative Mathematical Modeling
ANN Programming Manual - UMD Department of Computer Science
An Optimal Algorithm for Approximate Nearest Neighbor Searching
An interactive approach to parallel combinatorial algorithms with
AN INDEXING METHOD FOR SUPPORTING SPATIAL QUERIES IN STRUCTURED PEER-TO-PEER SYSTEMS
«
prev
1 ...
154
155
156
157
158
159
160
161
162
... 255
»
next
Suggest us how to improve StudyLib
(For complaints, use
another form
)
Your e-mail
Input it if you want to receive answer
Rate us
1
2
3
4
5
Cancel
Send