Sciweavers

6365 search results - page 460 / 1273
» Fast Local Computation Algorithms
Sort
View
AAAI
2010
15 years 9 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
15 years 2 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
BMCBI
2007
233views more  BMCBI 2007»
15 years 7 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
ICA
2007
Springer
15 years 11 months ago
Compact Representations of Market Securities Using Smooth Component Extraction
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...
Hariton Korizis, Nikolaos Mitianoudis, Anthony G. ...
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
16 years 4 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes