260 search results - page 6 / 52 » Hardness of Parameterized Resolution |
DICTA
2003
13 years 9 months ago
2003
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Many robotic control tasks involve complex dynamics that are hard to model. Hand-specifying trajectories that satisfy a system’s dynamics can be very time-consuming a...
PVLDB
2010
13 years 6 months ago
2010
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...