2430 search results - page 250 / 486 » Computing Tutte Polynomials |
138
click to vote
APAL
2007
15 years 4 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
138
Voted
CAGD
2008
15 years 4 months ago
2008
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
142
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
141
click to vote
ENGL
2008
15 years 4 months ago
2008
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
119
click to vote
IJHPCA
2006
15 years 4 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...