Sciweavers

2492 search results - page 185 / 499
» On the General Signature Trees
Sort
View
JAL
2002
113views more  JAL 2002»
15 years 6 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
TMC
2002
118views more  TMC 2002»
15 years 6 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
COR
2008
142views more  COR 2008»
15 years 6 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2011
Springer
235views Education» more  CORR 2011»
15 years 1 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
PAMI
2011
15 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams