Sciweavers

2498 search results - page 116 / 500
» Data Structures with Unpredictable Timing
Sort
View
ACIVS
2005
Springer
15 years 3 months ago
A Likelihood Ratio Test for Functional MRI Data Analysis to Account for Colored Noise
Abstract. Functional magnetic resonance (fMRI) data are often corrupted with colored noise. To account for this type of noise, many prewhitening and pre-coloring strategies have be...
Jan Sijbers, Arnold Jan den Dekker, Robert Bos
PAKDD
2010
ACM
171views Data Mining» more  PAKDD 2010»
14 years 8 months ago
Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
Yoann Pitarch, Anne Laurent, Pascal Poncelet
CF
2004
ACM
15 years 3 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
15 years 1 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf