Sciweavers

5473 search results - page 877 / 1095
» On the graph isomorphism problem
Sort
View
VISUALIZATION
1997
IEEE
15 years 10 months ago
Efficient subdivision of finite-element datasets into consistent tetrahedra
This paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while ...
Guy Albertelli, Roger Crawfis
EUROMICRO
1996
IEEE
15 years 10 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis
TAPSOFT
1997
Springer
15 years 10 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
DAC
1994
ACM
15 years 10 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 10 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt