Results 11 to 20 of about 502,069 (324)
The(frequently updated) original version is avalable at http://www.scholarpedia.org/article ...
Peter Földiák, Dominik M. Endres
core +6 more sources
Magnetic-Sparseness and Schrödinger Operators on Graphs [PDF]
We study magnetic Schrödinger operators on graphs. We extend the notion of sparseness of graphs by including a magnetic quantity called the frustration index.
M. Bonnefont +4 more
semanticscholar +2 more sources
Estimating optimal sparseness of developmental gene networks using a semi-quantitative model. [PDF]
To estimate gene regulatory networks, it is important that we know the number of connections, or sparseness of the networks. It can be expected that the robustness to perturbations is one of the factors determining the sparseness.
Natsuhiro Ichinose +2 more
doaj +3 more sources
The Relationship between Sparseness and Energy Consumption of Neural Networks
About 50-80% of total energy is consumed by signaling in neural networks. A neural network consumes much energy if there are many active neurons in the network. If there are few active neurons in a neural network, the network consumes very little energy.
Guanzheng Wang +3 more
semanticscholar +2 more sources
Augmented Collaborative Filtering for Sparseness Reduction in Personalized POI Recommendation [PDF]
As mobile device penetration increases, it has become pervasive for images to be associated with locations in the form of geotags. Geotags bridge the gap between the physical world and the cyberspace, giving rise to new opportunities to extract further ...
C. Cui +4 more
semanticscholar +2 more sources
Adaptive Sparseness for Supervised Learning
The goal of supervised learning is to infer a functional mapping based on a set of training examples. To achieve good generalization, it is necessary to control the "complexity" of the learned function.
Mário A. T. Figueiredo
semanticscholar +2 more sources
Proportionate NSAF Algorithms With Sparseness-Measured for Acoustic Echo Cancellation
Yi Yu
exaly +2 more sources
Sparse Convolution for Approximate Sparse Instance
Computing the convolution $A \star B$ of two vectors of dimension $n$ is one of the most important computational primitives in many fields. For the non-negative convolution scenario, the classical solution is to leverage the Fast Fourier Transform whose time complexity is $O(n \log n)$.
Xiaoxiao Li +2 more
openaire +3 more sources
Dissipativity Analysis of Large-Scale Networked Systems
This paper investigates the dissipativity analysis of large-scale networked systems with linear time-invariant dynamics. The networked system is composed of a large number of subsystems whose connections are arbitrary, and each subsystem can have ...
Yuanfei Sun, Jirong Wang, Huabo Liu
doaj +1 more source
Entrained behavior coordinates, predicts, and modulates multi-scale rhythmic gestures with high spatio-temporal precision even as it shows flexible adaptation in response to perturbation (Clayton et al., 2005; Altenmuller et al., 2006; Phillips-Silver et al., 2010).
Eric eBarnhill, Eric eBarnhill
openaire +3 more sources

