4843 search results - page 462 / 969 » The Shortcut Problem - Complexity and Approximation |
157
click to vote
SGAI
2004
Springer
15 years 10 months ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
137
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
143
click to vote
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
130
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
142
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...