Sciweavers

16596 search results - page 214 / 3320
» Generalized Assignment Problems
Sort
View
DM
2006
108views more  DM 2006»
15 years 6 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
COCOON
2007
Springer
16 years 20 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
JCDL
2006
ACM
111views Education» more  JCDL 2006»
16 years 13 days ago
Measuring inter-indexer consistency using a thesaurus
When professional indexers independently assign terms to a given document, the term sets generally differ between indexers. Studies of inter-indexer consistency measure the percen...
Olena Medelyan, Ian H. Witten
ICIP
2002
IEEE
16 years 8 months ago
A predictive contour inertia snake model for general video tracking
In this paper, we present a modified snake model for the problem of general video object tracking. We introduce a new external force into the snake equation based on the predictiv...
Hao Jiang, Mark S. Drew
INFOCOM
2008
IEEE
16 years 27 days ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...