Sciweavers

746 search results - page 84 / 150
» Fast (Structured) Newton Computations
Sort
View
FPL
2008
Springer
111views Hardware» more  FPL 2008»
13 years 10 months ago
Hyperreconfigurable architectures
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
Sebastian Lange, Martin Middendorf
BMCBI
2011
13 years 4 months ago
A quality metric for homology modeling: the H-factor
Background: The analysis of protein structures provides fundamental insight into most biochemical functions and consequently into the cause and possible treatment of diseases. As ...
Eric di Luccio, Patrice Koehl
ICPR
2004
IEEE
14 years 10 months ago
Car Detection Based on Multi-Cues Integration
In this paper we present a novel fast multi-cues based car detection technique in still outdoor images. On the bottom level, two novel area templates based on edge cue and interes...
Hanqing Lu, James Hu, Keiichi Uchimura, Zhenfeng Z...
IEEEPACT
2009
IEEE
14 years 3 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...
SAC
2002
ACM
13 years 8 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...