Sciweavers

1612 search results - page 95 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
148
Voted
NEUROSCIENCE
2001
Springer
15 years 6 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
ACL
2000
15 years 3 months ago
Minimally Supervised Morphological Analysis by Multimodal Alignment
This paper presents a corpus-based algorithm capable of inducing inflectional morphological analyses of both regular and highly irregular forms (such as broughtbring) from distrib...
David Yarowsky, Richard Wicentowski
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
15 years 8 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 6 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
112
Voted
DATE
2008
IEEE
204views Hardware» more  DATE 2008»
15 years 8 months ago
Deep Submicron Interconnect Timing Model with Quadratic Random Variable Analysis
Shrinking feature sizes and process variations are of increasing concern in modern technology. It is urgent that we develop statistical interconnect timing models which are harmon...
Jun-Kuei Zeng, Chung-Ping Chen