Sciweavers

6251 search results - page 1066 / 1251
» Randomness, Computability, and Density
Sort
View
MMMACNS
2005
Springer
15 years 9 months ago
Unique User-Generated Digital Pseudonyms
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
Peter Schartner, Martin Schaffer
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
15 years 9 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
ISLPED
2004
ACM
159views Hardware» more  ISLPED 2004»
15 years 9 months ago
Dynamic voltage scaling for systemwide energy minimization in real-time embedded systems
Traditionally, dynamic voltage scaling (DVS) techniques have focused on minimizing the processorenergy consumption as opposed to the entire system energy consumption. The slowdown...
Ravindra Jejurikar, Rajesh K. Gupta
SIGIR
2004
ACM
15 years 9 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
CCS
2004
ACM
15 years 9 months ago
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group as the method for remote authentication of a hardware mo...
Ernest F. Brickell, Jan Camenisch, Liqun Chen
« Prev « First page 1066 / 1251 Last » Next »