Sciweavers

32 search results - page 5 / 7
» Avoiding communication in sparse matrix computations
Sort
View
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 8 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 2 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
AMC
2010
175views more  AMC 2010»
13 years 7 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
PPOPP
1997
ACM
13 years 11 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon