942 search results - page 147 / 189 » Constraints in Graph Drawing Algorithms |
FCCM
2009
IEEE
14 years 1 months ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
VLDB
1998
ACM
14 years 2 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...