2957 search results - page 175 / 592 » The Complexity of Polynomial-Time Approximation |
176
click to vote
IJFCS
2006
15 years 6 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
155
click to vote
CANDC
2000
ACM
15 years 6 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
148
Voted
RSCTC
2000
Springer
15 years 9 months ago
2000
Springer
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
154
click to vote
JMM2
2007
15 years 6 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
175
Voted
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...