17329 search results - page 2814 / 3466 » Improved non-approximability results |
239
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
217
click to vote
CRV
2006
IEEE
15 years 11 months ago
2006
IEEE
Computational models of visual attention result in considerable data compression by eliminating processing on regions likely to be devoid of meaningful content. While saliency map...
254
click to vote
ASSETS
2006
ACM
15 years 11 months ago
2006
ACM
Finding lost items is a common problem for the visually impaired and is something that computing technology can help alleviate. In this paper, we present the design and evaluation...
193
click to vote
CRYPTO
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
167
click to vote
CSR
2006
Springer
15 years 11 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...