425 search results - page 47 / 85 » Polynomial Time Data Reduction for Dominating Set |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
111
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
ECCC
2006
14 years 11 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
116
click to vote
ICIP
2004
IEEE
16 years 28 days ago
2004
IEEE
In this paper, we propose a novel thick slab paradigm which provides an efficient scheme to navigate through large three dimensional (3-D) medical data sets within the framework o...
110
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...