Sciweavers

293 search results - page 54 / 59
» Optimal Integer Alphabetic Trees in Linear Time
Sort
View
COCOA
2007
Springer
14 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
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...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
INFORMS
2010
138views more  INFORMS 2010»
13 years 6 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
GLOBECOM
2009
IEEE
14 years 2 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
FOCS
2009
IEEE
13 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CVPR
2009
IEEE
15 years 2 months ago
Human Motion Synthesis from 3D Video
Multiple view 3D video reconstruction of actor performance captures a level-of-detail for body and clothing movement which is time-consuming to produce using existing animation ...
Peng Huang (University of Surrey), Adrian Hilton (...