194 search results - page 14 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
137
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
91
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
112
click to vote
PAMI
2007
14 years 12 months ago
2007
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
111
click to vote
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
AAAI
1998
15 years 1 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...