Sciweavers

2563 search results - page 127 / 513
» Parallel matrix algorithms and applications
Sort
View
HPDC
2007
IEEE
14 years 4 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 10 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
ASPLOS
2009
ACM
14 years 10 months ago
Architectural support for SWAR text processing with parallel bit streams: the inductive doubling principle
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
Robert D. Cameron, Dan Lin
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
14 years 10 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
14 years 1 months ago
An optimization approach to adaptive Kalman filtering
— In this paper, an optimization-based adaptive Kalman filtering method is proposed. The method produces an estimate of the process noise covariance matrix Q by solving an optim...
Maja Karasalo, Xiaoming Hu