360 search results - page 5 / 72 » Timing Minimization by Statistical Timing hMetis-based Parti... |
ICIP
2003
IEEE
14 years 23 days ago
2003
IEEE
We present similarity-based methods to cluster digital photos by time and image content. This approach is general, unsupervised, and makes minimal assumptions regarding the struct...
ASPDAC
1999
ACM
13 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
AMC
2006
13 years 7 months ago
2006
The problem of distinguishing density-independent (DI) from density-dependent (DD) demographic time series is important for understanding the mechanisms that regulate populations ...
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...