Sciweavers

3740 search results - page 101 / 748
» A Fast Skeletonization Method
Sort
View
IPPS
2003
IEEE
15 years 8 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
APPROX
2008
Springer
102views Algorithms» more  APPROX 2008»
15 years 5 months ago
Dense Fast Random Projections and Lean Walsh Transforms
Random projection methods give distributions over k
Edo Liberty, Nir Ailon, Amit Singer
WABI
2010
Springer
172views Bioinformatics» more  WABI 2010»
15 years 1 months ago
Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA
Abstract. Applied Biosystems’ SOLiD system offers a low-cost alternative to the traditional Sanger method of DNA sequencing. We introduce two main algorithms of mapping SOLiD’...
Miklós Csürös, Szilveszter Juhos,...
ICASSP
2008
IEEE
15 years 9 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
15 years 4 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
Karsten Rink, Arne-Michael Törsel, Klaus D. T...