Sciweavers

815 search results - page 112 / 163
» Approximate Entropy Reducts
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 12 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
JCM
2006
86views more  JCM 2006»
14 years 11 months ago
MAC Layer RFID Protocol for Low Cost Object Identification
In this paper, we introduce a novel medium access control (MAC) protocol for Radio Frequency Identification (RFID) systems. This protocol exploits the Markov Chain Model of Slotted...
Shweta Singh
SIAMSC
2008
117views more  SIAMSC 2008»
14 years 11 months ago
Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
María López-Fernández, Christ...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 11 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TNN
2008
177views more  TNN 2008»
14 years 11 months ago
Adaptive Importance Sampling to Accelerate Training of a Neural Probabilistic Language Model
Previous work on statistical language modeling has shown that it is possible to train a feed-forward neural network to approximate probabilities over sequences of words, resulting...
Yoshua Bengio, Jean-Sébastien Senecal