Sciweavers

2035 search results - page 210 / 407
» Working memory
Sort
View
IPPS
2006
IEEE
15 years 9 months ago
Dynamic program phase detection in distributed shared-memory multiprocessors
— We present a novel hardware mechanism for dynamic program phase detection in distributed sharedmemory (DSM) multiprocessors. We show that successful hardware mechanisms for pha...
Engin Ipek, José F. Martínez, Bronis...
ACMMSP
2006
ACM
278views Hardware» more  ACMMSP 2006»
15 years 9 months ago
Atomicity via source-to-source translation
We present an implementation and evaluation of atomicity (also known as software transactions) for a dialect of Java. Our implementation is fundamentally different from prior work...
Benjamin Hindman, Dan Grossman
118
Voted
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 9 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
118
Voted
PAKDD
2005
ACM
146views Data Mining» more  PAKDD 2005»
15 years 9 months ago
An Incremental Data Stream Clustering Algorithm Based on Dense Units Detection
Abstract. The data stream model of computation is often used for analyzing huge volumes of continuously arriving data. In this paper, we present a novel algorithm called DUCstream ...
Jing Gao, Jianzhong Li, Zhaogong Zhang, Pang-Ning ...
130
Voted
APN
2004
Springer
15 years 9 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo