Sciweavers

43 search results - page 2 / 9
» Designing fast converging phylogenetic methods
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 5 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2007
160views more  BMCBI 2007»
13 years 5 months ago
Convergent algorithms for protein structural alignment
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...
Leandro Martínez, Roberto Andreani, Jos&eac...
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
13 years 11 months ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky
DAC
2002
ACM
14 years 6 months ago
A solenoidal basis method for efficient inductance extraction
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
Hemant Mahawar, Vivek Sarin, Weiping Shi
ICASSP
2011
IEEE
12 years 9 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa