22 search results - page 4 / 5 » A Faster Counterexample Minimization Algorithm Based on Refu... |
ISPD
2006
ACM
14 years 1 months ago
2006
ACM
The existing decoupling capacitance optimization approaches meet constraints on input impedance for package. In this paper, we show that using impedance as constraints leads to la...
FCT
2001
Springer
13 years 12 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
MIS
2004
Springer
14 years 23 days ago
2004
Springer
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
SIGMOD
2009
ACM
14 years 2 months ago
2009
ACM
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...