Sciweavers

269 search results - page 18 / 54
» random 2001
Sort
View
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Two-Party Generation of DSA Signatures
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
Philip D. MacKenzie, Michael K. Reiter
NIPS
2001
13 years 11 months ago
An Efficient Clustering Algorithm Using Stochastic Association Model and Its Implementation Using Nanostructures
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
Takashi Morie, Tomohiro Matsuura, Makoto Nagata, A...
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 10 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...

Source Code
846views
14 years 4 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato
DCC
2001
IEEE
14 years 9 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher