Sciweavers

8298 search results - page 10 / 1660
» On the Complexity of Numerical Analysis
Sort
View
DCC
2005
IEEE
15 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
HYBRID
2000
Springer
15 years 1 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
TNN
2010
173views Management» more  TNN 2010»
14 years 4 months ago
Global synchronization for discrete-time stochastic complex networks with randomly occurred nonlinearities and mixed time delays
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
Zidong Wang, Yao Wang, Yurong Liu
ISBI
2011
IEEE
14 years 1 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
SAS
2010
Springer
172views Formal Methods» more  SAS 2010»
14 years 8 months ago
Deriving Numerical Abstract Domains via Principal Component Analysis
Numerical Abstract Domains via Principal Component Analysis Gianluca Amato, Maurizio Parton, and Francesca Scozzari Universit`a di Chieti-Pescara – Dipartimento di Scienze We pro...
Gianluca Amato, Maurizio Parton, Francesca Scozzar...