Sciweavers

5624 search results - page 43 / 1125
» On Conditional Covering Problem
Sort
View
DAM
1999
119views more  DAM 1999»
15 years 2 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
104
Voted
AAAI
2007
15 years 4 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
MST
2007
138views more  MST 2007»
15 years 1 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 8 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
120
Voted
ICADL
2004
Springer
162views Education» more  ICADL 2004»
15 years 7 months ago
Character Region Identification from Cover Images Using DTT
A robust character region identification approach is proposed here to deal with cover images using a differential top-hat transformation (DTT). The DTT is derived from morphologica...
Lixu Gu