Sciweavers

14078 search results - page 325 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
15 years 8 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
CAV
2009
Springer
132views Hardware» more  CAV 2009»
16 years 7 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
TVCG
2012
179views Hardware» more  TVCG 2012»
13 years 9 months ago
Parallel Computation of 2D Morse-Smale Complexes
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...
DAC
2003
ACM
16 years 7 months ago
Multilevel global placement with retiming
Multiple clock cycles are needed to cross the global interconnects for multi-gigahertz designs in nanometer technologies. For synchronous designs, this requires retiming and pipel...
Jason Cong, Xin Yuan