1331 search results - page 200 / 267 » Complexity bounds for zero-test algorithms |
SPIRE
2007
Springer
15 years 3 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
ISMVL
2006
IEEE
15 years 3 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
VISSOFT
2005
IEEE
15 years 3 months ago
2005
IEEE
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
106
click to vote
RANDOM
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
MINAR
1998
Springer
15 years 2 months ago
1998
Springer
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...