Sciweavers

5105 search results - page 393 / 1021
» Approximate Structural Consistency
Sort
View
NIPS
2000
15 years 8 months ago
Rate-coded Restricted Boltzmann Machines for Face Recognition
We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then ...
Yee Whye Teh, Geoffrey E. Hinton
OSDI
1996
ACM
15 years 8 months ago
Online Data-Race Detection via Coherency Guarantees
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
Dejan Perkovic, Peter J. Keleher
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
Bayesian model averaging, model selection and its approximations such as BIC are generally statistically consistent, but sometimes achieve slower rates of convergence than other m...
Tim van Erven, Peter Grünwald, Steven de Rooi...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 6 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
15 years 6 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila