Sciweavers

285 search results - page 31 / 57
» New Ways to Construct Binary Search Trees
Sort
View
DIM
2008
ACM
15 years 1 months ago
Minimal information disclosure with efficiently verifiable credentials
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
David Bauer, Douglas M. Blough, David Cash
VMV
2001
132views Visualization» more  VMV 2001»
15 years 1 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
14 years 11 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
EUROCRYPT
2004
Springer
15 years 5 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
HIPC
2005
Springer
15 years 5 months ago
Orthogonal Decision Trees for Resource-Constrained Physiological Data Stream Monitoring Using Mobile Devices
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
Haimonti Dutta, Hillol Kargupta, Anupam Joshi