4894 search results - page 473 / 979 » The Guarding Problem - Complexity and Approximation |
134
Voted
WEA
2005
Springer
15 years 11 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
174
click to vote
SGAI
2004
Springer
15 years 11 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...
156
click to vote
ESA
2003
Springer
15 years 11 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 ...
160
click to vote
COCOON
1999
Springer
15 years 10 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...
146
Voted
ICASSP
2009
IEEE
15 years 10 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. ...