14642 search results - page 2546 / 2929 » It's Time for a Change |
167
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
181
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
252
click to vote
DATAMINE
2010
15 years 7 months ago
2010
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
184
click to vote
DATAMINE
2010
15 years 7 months ago
2010
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
212
click to vote
DATAMINE
2008
15 years 7 months ago
2008
Abstract We address the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. We follow a two-step methodology: first we iden...