603 search results - page 27 / 121 » A General Approximation Technique for Constrained Forest Pro... |
131
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
125
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
144
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
116
click to vote
PVLDB
2008
15 years 28 days ago
2008
Abstract Existing solutions to the automated physical design problem in database systems attempt to minimize execution costs of input workloads for a given storage constraint. In t...
106
click to vote
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...