Sciweavers

1101 search results - page 37 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
PG
2007
IEEE
14 years 2 months ago
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
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...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
MFCS
2004
Springer
14 years 1 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
IJMC
2006
84views more  IJMC 2006»
13 years 8 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: 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 ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
ENTCS
2008
97views more  ENTCS 2008»
13 years 8 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
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...
Karl-Heinz Pennemann
NIPS
2004
13 years 10 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
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...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp