1101 search results - page 37 / 221 » An Algorithm for the Graph Crossing Number Problem |
111
click to vote
PG
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
134
Voted
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
109
click to vote
IJMC
2006
15 years 1 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
113
click to vote
ENTCS
2008
15 years 2 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
125
click to vote
NIPS
2004
15 years 3 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...