Sciweavers

577 search results - page 63 / 116
» A neurodynamical model for working memory
Sort
View
190
Voted
LATIN
2010
Springer
16 years 19 days ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
114
Voted
ASPLOS
2006
ACM
16 years 4 days ago
Atomicity and visibility in tiny embedded systems
Visibility is a property of a programming language’s memory model that determines when values stored by one concurrent computation become visible to other computations. Our work...
John Regehr, Nathan Cooprider, David Gay
170
Voted
JSSPP
2004
Springer
15 years 11 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
ICS
2010
Tsinghua U.
15 years 11 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...
125
Voted
ICRA
1998
IEEE
101views Robotics» more  ICRA 1998»
15 years 10 months ago
An Approach to Reduction of Hysteresis in Smart Materials
This paper addresses the problem of reducing the hysteresis found in the actuation of most smart materials. They are divided in two groups: systems with no saturation (e.g. piezoe...
Juan Manuel Cruz-Hernández, Vincent Hayward