Sciweavers

3171 search results - page 13 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
FCCM
2006
IEEE
106views VLSI» more  FCCM 2006»
15 years 8 months ago
Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
Abstract— This paper introduces a novel architecture for performing the core computations required by dynamic programming (DP) techniques. The latter pertain to a vast range of a...
Brad Matthews, Itamar Elhanany
IPPS
1999
IEEE
15 years 6 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
IPPS
2007
IEEE
15 years 8 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
115
Voted
CLUSTER
2009
IEEE
15 years 8 months ago
An innovative application execution toolkit for multicluster grids
—Multicluster grids provide one promising solution to satisfying growing computation demands of compute-intensive applications by collaborating various networked clusters. Howeve...
Zhifeng Yun, Zhou Lei, Gabrielle Allen, Daniel S. ...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 2 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...