Sciweavers

287 search results - page 4 / 58
» UDS: A Universal Data Structure
Sort
View
MST
2006
97views more  MST 2006»
13 years 7 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
SMA
2003
ACM
151views Solid Modeling» more  SMA 2003»
14 years 27 days ago
An architecture for universal CAD data exchange
Parametric feature-based CAD data exchange is one of the most important open problems in solid modeling. The problem is significant and challenging both scientifically and comme...
Ari Rappoport
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
VLDB
2005
ACM
206views Database» more  VLDB 2005»
14 years 1 months ago
Native XML Support in DB2 Universal Database
The major relational database systems have been providing XML support for several years, predominantly by mapping XML to existing concepts such as LOBs or (object-)relational tabl...
Matthias Nicola, Bert Van der Linden

Lecture Notes
633views
15 years 5 months ago
Algorithms
Set of lecture notes for the algorithms classes required for all computer science undergraduate and graduate students at the University of Illinois, Urbana-Champaign.
Jeff Erickson