425 search results - page 49 / 85 » Polynomial Time Data Reduction for Dominating Set |
119
click to vote
CVPR
1998
IEEE
16 years 1 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
111
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
SC
2000
ACM
15 years 3 months ago
2000
ACM
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
CODES
2007
IEEE
15 years 5 months ago
2007
IEEE
Networks on Chip (NoC) have emerged as the design paradigm for scalable System on Chip communication infrastructure. A growing number of applications, often with firm (FRT) or so...