Results 1  10
of
987
RealTime Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
"... A key challenge for neural modeling is to explain how a continuous stream of multimodal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrateandfire neurons in realtime. We propose a new computational model for realtime computing on timevar ..."
Abstract

Cited by 469 (38 self)
 Add to MetaCart
varying input that provides an alternative to paradigms based on Turing machines or attractor neural networks. It does not require a taskdependent construction of neural circuits. Instead it is based on principles of high dimensional dynamical systems in combination with statistical learning theory, and can
PrivacyPreserving Data Mining
, 2000
"... A fruitful direction for future data mining research will be the development of techniques that incorporate privacy concerns. Specifically, we address the following question. Since the primary task in data mining is the development of models about aggregated data, can we develop accurate models with ..."
Abstract

Cited by 844 (3 self)
 Add to MetaCart
A fruitful direction for future data mining research will be the development of techniques that incorporate privacy concerns. Specifically, we address the following question. Since the primary task in data mining is the development of models about aggregated data, can we develop accurate models
perturbation theory
, 2006
"... The second order perturbations in FriedmannRobertsonWalker universe filled with a perfect fluid are completely formulated in the gauge invariant manner without any gauge fixing. All components of the Einstein equations are derived neglecting the first order vector and tensor modes. These equations ..."
Abstract
 Add to MetaCart
The second order perturbations in FriedmannRobertsonWalker universe filled with a perfect fluid are completely formulated in the gauge invariant manner without any gauge fixing. All components of the Einstein equations are derived neglecting the first order vector and tensor modes
PrivacyPreserving Collaborative Filtering Using Randomized Perturbation Techniques
, 2003
"... Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. Ecommerce sites use CF systems to suggest products to customers based on likeminded customers' preferences. People use CF systems to cope with information overload. To conduct collabo ..."
Abstract

Cited by 66 (2 self)
 Add to MetaCart
collaborative filtering, data from customers are needed. However, collecting high quality data from customers is not an easy task because many customers are so concerned about their privacy that they might decide to give false information. CF systems using these data might produce inaccurate recommendations. We
Summed Weight Neuron Perturbation: An O(N) Improvement over Weight Perturbation.
 Advances in Neural Information Processing Systems (NIPS92
, 1993
"... The algorithm presented performs gradient descent on the weight space of an Artificial Neural Network (ANN), using a finite difference to approximate the gradient. The method is novel in that it achieves a computational complexity similar to that of Node Perturbation, O(N 3 ), but does not require ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
The algorithm presented performs gradient descent on the weight space of an Artificial Neural Network (ANN), using a finite difference to approximate the gradient. The method is novel in that it achieves a computational complexity similar to that of Node Perturbation, O(N 3 ), but does
Decomposition of perturbed Chebyshev polynomials
, 2007
"... We characterize polynomial decomposition fn = r ◦ q with r, q ∈ C[x] of perturbed Chebyshev polynomials defined by the recurrence f0(x) = b, f1(x) = x − c, fn+1(x) = (x − d)fn(x) − afn−1(x), n ≥ 1, where a, b, c, d ∈ R and a> 0. These polynomials generalize the Chebyshev polynomials, which ar ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We characterize polynomial decomposition fn = r ◦ q with r, q ∈ C[x] of perturbed Chebyshev polynomials defined by the recurrence f0(x) = b, f1(x) = x − c, fn+1(x) = (x − d)fn(x) − afn−1(x), n ≥ 1, where a, b, c, d ∈ R and a> 0. These polynomials generalize the Chebyshev polynomials, which
Effects of aging and dual tasking on step adjustments to perturbations in visually cued walking
, 2015
"... adjustment task, a strategy that may pose aging populations at a greater fall risk. For comparable task difficulty, the older adults performed considerably worse than the young adults, indicating a decreased ability to adjust steps under time pressure. ..."
Abstract
 Add to MetaCart
adjustment task, a strategy that may pose aging populations at a greater fall risk. For comparable task difficulty, the older adults performed considerably worse than the young adults, indicating a decreased ability to adjust steps under time pressure.
Pattern name Perturbation Analysis
"... Patterns are a tool that enables the collective knowledge of a particular community to be recorded and transmitted in an efficient manner. Initially developed in the field of architecture and later developed by software engineers [6], they have now been adopted by the complex systems modelling commu ..."
Abstract
 Add to MetaCart
community [15]. It can be argued that, while most complex systems models are idiosyncratic and highly specific to the task for which they are constructed, certain tools and methodologies may be abstracted to a level at which they are more generally applicable. This paper presents one such pattern
Migrating to optimal RBAC with minimal perturbation
 in Proceedings of the 13th ACM Symposium on Access Control Models and Technologies Proceedings SACMAT ’08. ACM
, 2008
"... Devising a complete and correct set of roles has been recognized as one of the most important and challenging tasks in implementing role based access control. A key problem related to this is the notion of goodness when is a set of roles good? Recently, the role mining problem (RMP) has been define ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Devising a complete and correct set of roles has been recognized as one of the most important and challenging tasks in implementing role based access control. A key problem related to this is the notion of goodness when is a set of roles good? Recently, the role mining problem (RMP) has been
Results 1  10
of
987