1208 search results - page 3 / 242 » On Counting Generalized Colorings |
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
ICIP
2003
IEEE
14 years 7 days ago
2003
IEEE
This paper introduces a new approach to automatic car detection in monocular large scale aerial images. The extraction is based on a hierarchical 3D-model that describes the promi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
AAAI
2007
13 years 9 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...