808 search results - page 95 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
SIGMOD
2011
ACM
14 years 16 days ago
2011
ACM
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
ISLPED
2007
ACM
14 years 11 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
118
click to vote
DIS
2007
Springer
15 years 1 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
35
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...