Sciweavers

822 search results - page 82 / 165
» Hashing Methods for Temporal Data
Sort
View
FLAIRS
2000
15 years 3 months ago
Deriving Summaries Through an Identity-Based Approach
The existence of large datasets requires methods for producing simpler or summarized views of data. Typical approaches to summarization based on statistics do not capture complete...
Kathleen Hornsby
138
Voted
TJS
2002
121views more  TJS 2002»
15 years 2 months ago
Precise Data Locality Optimization of Nested Loops
A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. In...
Vincent Loechner, Benoît Meister, Philippe C...
157
Voted
TITB
2010
123views Education» more  TITB 2010»
14 years 9 months ago
The pseudotemporal bootstrap for predicting glaucoma from cross-sectional visual field data
Progressive loss of the field of vision is characteristic of a number of eye diseases such as glaucoma, a leading cause of irreversible blindness in the world. Recently, there has ...
Allan Tucker, David Garway-Heath
DSMML
2004
Springer
15 years 8 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
IACR
2011
149views more  IACR 2011»
14 years 2 months ago
Public Key Encryption for the Forgetful
We investigate public key encryption that allows the originator of a ciphertext to retrieve a “forgotten” plaintext from the ciphertext. This type of public key encryption wit...
Puwen Wei, Yuliang Zheng, Xiaoyun Wang