Sciweavers

822 search results - page 75 / 165
» Hashing Methods for Temporal Data
Sort
View
MSS
2007
IEEE
129views Hardware» more  MSS 2007»
15 years 8 months ago
Cryptographic Security for a High-Performance Distributed File System
Storage systems are increasingly subject to attacks. Cryptographic file systems mitigate the danger of exposing data by using encryption and integrity protection methods and guar...
Roman Pletka, Christian Cachin
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 3 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
IJNSEC
2008
209views more  IJNSEC 2008»
15 years 2 months ago
Application-Specific Key Release Scheme from Biometrics
This paper outlines a novel biometric key release scheme to bind application-specific key from biometric data such that the key can be retrieved effectively by using DiscreteHashi...
Thian Song Ong, Andrew Teoh Beng Jin, David Chek L...
AAAI
2010
15 years 4 months ago
Discovering Long Range Properties of Social Networks with Multi-Valued Time-Inhomogeneous Models
The current methods used to mine and analyze temporal social network data make two assumptions: all edges have the same strength, and all parameters are time-homogeneous. We show ...
Danny Wyatt, Tanzeem Choudhury, Jeff Bilmes
IJCNN
2000
IEEE
15 years 6 months ago
Competing Hidden Markov Models on the Self-Organizing Map
This paper presents an unsupervised segmentation method for feature sequences based on competitivelearning hidden Markov models. Models associated with the nodes of the Self-Organ...
Panu Somervuo