2988 search results - page 281 / 598 » Experiments with a New Boosting Algorithm |
130
click to vote
DATE
1998
IEEE
15 years 8 months ago
1998
IEEE
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
126
click to vote
ISER
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we present a new approach for continuous probabilistic mapping. The objective is to build metric maps of unknown environments through cooperation between multiple au...
149
click to vote
CIKM
1998
Springer
15 years 8 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
125
click to vote
CIAC
1997
Springer
15 years 8 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
114
Voted
GCB
1997
Springer
15 years 8 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....