DMIN
2009
13 years 9 months ago
2009
- This short paper compares the performance of three popular decision tree algorithms: C4.5, C5.0, and WEKA's J48. These decision tree algorithms are all related in that C5.0 ...
CPM
2009
Springer
13 years 9 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
CORR
2009
Springer
13 years 9 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
CIARP
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...
BILDMED
2009
13 years 9 months ago
2009
Abstract. An extension of the normalized mutual information similarity measurement was proposed to register cardiac PET/CT and SPECT images representing coronary artery disease in ...
ASIAN
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
APWEB
2009
Springer
13 years 9 months ago
2009
Springer
Along with the development of Web2.0, folksonomy has become a hot topic related to data mining, information retrieval and social network. The tag semantic is the key for deep under...
APPROX
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
ALENEX
2009
13 years 9 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
ALDT
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We axiomatically characterise a class of algorithms for making sequential decisions in situations of complete ignorance. These algorithms assume that a decision maker (DM...