Sciweavers

2479 search results - page 76 / 496
» A Computational Theory of Working Memory
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
JUCS
2010
160views more  JUCS 2010»
13 years 2 months ago
How Incomputable is Finding Nash Equilibria?
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
Arno Pauly
IPPS
2007
IEEE
14 years 2 months ago
Parallel Audio Quick Search on Shared-Memory Multiprocessor Systems
Audio search plays an important role in analyzing audio data and retrieving useful audio information. In this paper, a Partially Overlapping Block-Parallel Active Search method (P...
Yurong Chen, Wei Wei, Yimin Zhang
IPPS
2006
IEEE
14 years 1 months ago
A configuration memory hierarchy for fast reconfiguration with reduced energy consumption overhead
Currently run-time reconfigurable hardware offers really attractive features for embedded systems, such as flexibility, reusability, high performance and, in some cases, low-power...
Elena Perez Ramo, Javier Resano, Daniel Mozos, Fra...
IPPS
2006
IEEE
14 years 1 months ago
Tree partition based parallel frequent pattern mining on shared memory systems
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...