1522 search results - page 80 / 305 » Practical Exception Specifications |
164
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
135
Voted
SP
2010
IEEE
14 years 11 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
135
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: The program InDeVal was originally developed to help researchers find known regions of insertion/deletion activity (with the exception of isolated single-base indels) ...
106
click to vote
DPPI
2007
ACM
15 years 5 months ago
2007
ACM
The near ubiquity of mobile phones in the world and in people's lives, have created new opportunities for reinterpretation of what these devices are and what they do. One area...
145
click to vote
ACST
2006
15 years 3 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...