293 search results - page 54 / 59 » Optimal Integer Alphabetic Trees in Linear Time |
127
Voted
COCOA
2007
Springer
15 years 9 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...
110
click to vote
INFORMS
2010
15 years 1 months ago
2010
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...
146
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—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...
148
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
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...
163
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
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 ...