1376 search results - page 203 / 276 » Searching Trees: An Essay |
155
click to vote
ECML
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
170
click to vote
WABI
2001
Springer
15 years 10 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
149
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
166
click to vote
ACSAC
1999
IEEE
15 years 10 months ago
1999
IEEE
Differentiating anomalous network activity from normal network traffic is difficult and tedious. A human analyst must search through vast amounts of data to find anomalous sequenc...
193
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...