Sciweavers

6365 search results - page 358 / 1273
» Fast Local Computation Algorithms
Sort
View
ISBI
2009
IEEE
16 years 2 months ago
Fast Haar-Wavelet Denoising of Multidimensional Fluorescence Microscopy Data
We propose a novel denoising algorithm to reduce the Poisson noise that is typically dominant in fluorescence microscopy data. To process large datasets at a low computational co...
Florian Luisier, Cédric Vonesch, Thierry Bl...
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
16 years 24 days ago
Fast, predictable and low energy memory references through architecture-aware compilation
The design of future high-performance embedded systems is hampered by two problems: First, the required hardware needs more energy than is available from batteries. Second, curren...
Peter Marwedel, Lars Wehmeyer, Manish Verma, Stefa...
AIPS
2008
15 years 9 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
15 years 9 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
DAGSTUHL
2008
15 years 8 months ago
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
Walter Krämer, Michael Zimmer