281 search results - page 25 / 57 » Balancing weight-balanced trees |
NAACL
1994
13 years 9 months ago
1994
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
ALENEX
2010
13 years 10 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...