Sciweavers

12194 search results - page 2370 / 2439
» cans 2010
Sort
View
RSA
2010
107views more  RSA 2010»
13 years 8 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
SAC
2010
ACM
13 years 8 months ago
The 'Dresden Image Database' for benchmarking digital image forensics
This paper introduces and documents a novel image database specifically built for the purpose of development and benchmarking of camera-based digital forensic techniques. More th...
Thomas Gloe, Rainer Böhme
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
SCN
2010
Springer
187views Communications» more  SCN 2010»
13 years 8 months ago
Searching Keywords with Wildcards on Encrypted Data
Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption ke...
Saeed Sedghi, Peter van Liesdonk, Svetla Nikova, P...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 8 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
« Prev « First page 2370 / 2439 Last » Next »