2996 search results - page 341 / 600 » Numberings and Randomness |
183
click to vote
CRYPTO
2005
Springer
16 years 9 days ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
201
click to vote
ECML
2004
Springer
16 years 4 days ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
187
click to vote
MOBICOM
2003
ACM
16 years 12 hour ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
197
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
220
click to vote
EUROCAST
1997
Springer
15 years 11 months ago
1997
Springer
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...