Sciweavers

28888 search results - page 70 / 5778
» Computability and complexity in analysis
Sort
View
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
COMPGEOM
2004
ACM
14 years 1 months ago
Computing persistent homology
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
Afra Zomorodian, Gunnar Carlsson
HCW
1999
IEEE
14 years 7 days ago
Simulation of Task Graph Systems in Heterogeneous Computing Environments
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
Noé Lopez-Benitez, Ja-Young Hyon
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
14 years 6 days ago
Improved Effective Capacitance Computations for Use in Logic and Layout Optimization
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...
Andrew B. Kahng, Sudhakar Muddu
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
13 years 11 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu