Sciweavers

550 search results - page 87 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
ANOR
2010
130views more  ANOR 2010»
13 years 6 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
CVIU
2006
169views more  CVIU 2006»
13 years 9 months ago
A generic structure-from-motion framework
We introduce a generic structure-from-motion approach based on a previously introduced, highly general imaging model, where cameras are modeled as possibly unconstrained sets of p...
Srikumar Ramalingam, Suresh K. Lodha, Peter F. Stu...
ENTCS
2007
99views more  ENTCS 2007»
13 years 9 months ago
Extending Symmetry Reduction Techniques to a Realistic Model of Computation
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
Alastair F. Donaldson, Alice Miller
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 3 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 1 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas