Sciweavers

40212 search results - page 8038 / 8043
» More
Sort
View
ISCI
2007
141views more  ISCI 2007»
13 years 8 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
BMCBI
2005
108views more  BMCBI 2005»
13 years 8 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
CCR
2005
103views more  CCR 2005»
13 years 8 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
CORR
1998
Springer
84views Education» more  CORR 1998»
13 years 8 months ago
Comparing a statistical and a rule-based tagger for German
In this paper we present the results of comparing a statistical tagger for German based on decision trees and a rule-based Brill-Tagger for German. We used the same training corpu...
Martin Volk, Gerold Schneider
ECCC
1998
118views more  ECCC 1998»
13 years 8 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
« Prev « First page 8038 / 8043 Last » Next »