Sciweavers

1646 search results - page 55 / 330
» fast 2007
Sort
View
PDPTA
2000
15 years 2 months ago
Fast Communication Mechanisms in Coarse-grained Dynamically Reconfigurable Array Architectures
The paper focuses on coarse-grained dynamically reconfigurable array architectures promising performance and flexibility for different challenging application areas, e. g. future ...
Jürgen Becker, Manfred Glesner, Ahmad Alsolai...
101
Voted
MVA
1994
195views Computer Vision» more  MVA 1994»
15 years 2 months ago
A Fast Corner Detection Algorithm Based on Area Deviation
A new algorithm, based on area-deviation, is proposed for the detection of corner points of digitized curves. The algorithm consists of two steps. In the first step, a fixed-lengt...
Hao Zhou, Lejun Shao
131
Voted
BMCBI
2006
129views more  BMCBI 2006»
15 years 23 days ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
124
Voted
IM
2008
15 years 21 days ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
89
Voted
JCB
2007
168views more  JCB 2007»
15 years 18 days ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang