Sciweavers

1225 search results - page 66 / 245
» The Instance Complexity Conjecture
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Towards Robust Pedestrian Detection in Crowded Image Sequences
Object class detection in scenes of realistic complexity remains a challenging task in computer vision. Most recent approaches focus on a single and general model for object class...
Edgar Seemann, Mario Fritz, Bernt Schiele
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 3 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ISMVL
2009
IEEE
96views Hardware» more  ISMVL 2009»
14 years 3 months ago
Evaluation of Cardinality Constraints on SMT-Based Debugging
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
André Sülflow, Robert Wille, Görs...
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
14 years 3 months ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
EVOW
2006
Springer
14 years 20 days ago
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
István Juhos, Jano I. van Hemert