1193 search results - page 108 / 239 » A primer of simple theories |
170
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
161
click to vote
ESTIMEDIA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract—Few analytical performance models that relate performance figure of merit to architectural design decisions are reported in recent studies of network-on-chip, which pre...
172
click to vote
FOIKS
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a simple and practically efficient method for repairing inconsistent databases. The idea is to properly represent the underlying problem, and then use off-the-shelf a...
157
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
175
click to vote
ILP
2004
Springer
15 years 11 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...