Sciweavers

1950 search results - page 36 / 390
» Varieties of Increasing Trees
Sort
View
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
14 years 10 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref
ICASSP
2008
IEEE
14 years 3 months ago
Modified polyphone decision tree specialization for porting multilingual Grapheme based ASR systems to new languages
Automatic speech recognition (ASR) systems have been developed only for a very limited number of the estimated 7,000 languages in the world. In order to avoid the evolvement of a ...
Sebastian Stüker
ICMI
2003
Springer
138views Biometrics» more  ICMI 2003»
14 years 1 months ago
Large vocabulary sign language recognition based on hierarchical decision trees
The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition ...
Gaolin Fang, Wen Gao, Debin Zhao
FPL
2008
Springer
122views Hardware» more  FPL 2008»
13 years 10 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno
AAAI
2010
13 years 10 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...