Sciweavers

118 search results - page 10 / 24
» Algorithms for the placement of diagrams on maps
Sort
View
ASPDAC
1998
ACM
101views Hardware» more  ASPDAC 1998»
13 years 12 months ago
An Integrated Flow for Technology Remapping and Placement of Sub-half-micron Circuits
ABSTRACT - This paper presents a new design flow, FPDSiMPA, and a set of techniques for synthesizing high-performance sub-half micron logic circuits. FPD-SiMPA consists of logic p...
Jinan Lou, Amir H. Salek, Massoud Pedram
PASTE
2005
ACM
14 years 1 months ago
Static control-flow analysis for reverse engineering of UML sequence diagrams
UML sequence diagrams are commonly used to represent the interactions among collaborating objects. Reverse-engineered sequence diagrams are constructed from existing code, and hav...
Atanas Rountev, Olga Volgin, Miriam Reddoch
DAC
2006
ACM
14 years 8 months ago
Optimal simultaneous mapping and clustering for FPGA delay optimization
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
Joey Y. Lin, Deming Chen, Jason Cong
COMPGEOM
2009
ACM
14 years 2 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
14 years 2 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk