Sciweavers

6568 search results - page 287 / 1314
» Reducing the Complexity of Reductions
Sort
View
COMPGEOM
1996
ACM
15 years 11 months ago
Linear Complexity Hexahedral Mesh Generation
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
David Eppstein
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
15 years 10 months ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev
189
Voted
EURODAC
1995
IEEE
156views VHDL» more  EURODAC 1995»
15 years 10 months ago
VHDL quality: synthesizability, complexity and efficiency evaluation
With VHDL models increasing their size, it becomes more important to assure the quality of these descriptions in order to improve simulation performances, to make project maintain...
M. Mastretti
ENDM
2010
103views more  ENDM 2010»
15 years 4 months ago
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
Mathieu Lacroix, Ali Ridha Mahjoub, Sébasti...
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
15 years 11 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
Cheng-Kok Koh, Patrick H. Madden