Sciweavers

2088 search results - page 247 / 418
» The Probabilistic Method
Sort
View
136
Voted
ICONIP
1998
15 years 4 months ago
Summation Characteristics of PDM Digital Neural Network System
A PDM (Pulse Density Modulating) digital neural network system, which consists of 1,000 neurons physically interconnected by one million 7-bit synapses, was developed in our labor...
Hideki Toda, Yuzo Hirai
103
Voted
SIAMDM
2000
69views more  SIAMDM 2000»
15 years 3 months ago
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
Jaikumar Radhakrishnan, Amnon Ta-Shma
IJON
2010
109views more  IJON 2010»
14 years 10 months ago
Variational inference for Student-t MLP models
This paper presents a novel methodology to infer parameters of probabilistic models whose output noise is a Student-t distribution. The method is an extension of earlier work for ...
Hang T. Nguyen, Ian T. Nabney
125
Voted
ICS
2010
Tsinghua U.
16 years 27 days ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
AAAI
2008
15 years 5 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang