450 search results - page 68 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
294
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
164
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
256
click to vote
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
170
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
122
click to vote
ICCAD
2004
IEEE
16 years 2 months ago
2004
IEEE
With the increase of design complexities and the decrease of minimal feature sizes, IP reuse is becoming a common practice while crosstalk is becoming a critical issue that must b...