4843 search results - page 842 / 969 » The Shortcut Problem - Complexity and Approximation |
131
click to vote
APLAS
2003
ACM
15 years 6 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
123
click to vote
FSTTCS
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
130
click to vote
RSCTC
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
112
click to vote
KDD
1997
ACM
15 years 6 months ago
1997
ACM
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
137
click to vote
KDD
1997
ACM
15 years 6 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...