1554 search results - page 76 / 311 » Parameterized Complexity and Approximation Algorithms |
120
Voted
EUROIMSA
2006
15 years 4 months ago
2006
Exaggeration is often used in art and entertainment to capture the interest and attention of an audience. We present an approach to automatically exaggerate the distinctive featur...
ECCC
2010
15 years 3 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
118
click to vote
OOPSLA
2007
Springer
15 years 9 months ago
2007
Springer
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...
144
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...