16404 search results - page 743 / 3281 » A set coverage problem |
172
click to vote
POPL
1997
ACM
15 years 11 months ago
1997
ACM
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
223
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
175
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
209
click to vote
RSCTC
2000
Springer
15 years 11 months ago
2000
Springer
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
178
click to vote
ACL
2008
15 years 9 months ago
2008
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...