Sciweavers

4377 search results - page 137 / 876
» Mass problems and randomness
Sort
View
PROVSEC
2007
Springer
16 years 18 days ago
Practical Threshold Signatures Without Random Oracles
We propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT’05. The new thre...
Jin Li, Tsz Hon Yuen, Kwangjo Kim
ICANN
2005
Springer
16 years 1 hour ago
Can Dynamic Neural Filters Produce Pseudo-Random Sequences?
Abstract. Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large c...
Yishai M. Elyada, David Horn
WIRN
2005
Springer
15 years 12 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
AI
2001
Springer
15 years 11 months ago
How AI Can Help SE; or: Randomized Search Not Considered Harmful
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
Tim Menzies, Harshinder Singh
UAI
2004
15 years 7 months ago
Exponential Families for Conditional Random Fields
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
Yasemin Altun, Alexander J. Smola, Thomas Hofmann