Sciweavers

269 search results - page 9 / 54
» Computing the inverse sort transform in linear time
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Adaptive Linear Predictors for Real-Time Tracking
Enlarging or reducing the template size by adding new parts, or removing parts of the template, according to their suitability for tracking, requires the ability to deal with the ...
Stefan Holzer, Slobodan Ilic, Nassir Navab
DAC
2005
ACM
14 years 8 months ago
ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction
This paper presents an efficient hierarchical 3D capacitance extraction algorithm -- ICCAP. Most previous capacitance extraction algorithms introduce intermediate variables to fac...
Rong Jiang, Yi-Hao Chang, Charlie Chung-Ping Chen
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
14 years 26 days ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
RECOMB
2010
Springer
13 years 5 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
VLSID
1994
IEEE
151views VLSI» more  VLSID 1994»
13 years 11 months ago
A CORDIC Based Programmable DXT Processor Array
A CORDIC based processor array which can be programmed by switch settings to compute the Discrete Hariley, Cosine or Sine lhnsforms or their inverses is described. Through a novel...
V. K. Anuradha, V. Visvanathan