Sciweavers

16430 search results - page 460 / 3286
» On Computable Tree Functions
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
15 years 6 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
COR
2004
111views more  COR 2004»
15 years 6 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
EMNLP
2009
15 years 4 months ago
Synchronous Tree Adjoining Machine Translation
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
Steve DeNeefe, Kevin Knight
ICPR
2006
IEEE
16 years 8 months ago
A New Objective Function for Ensemble Selection in Random Subspaces
Most works based on diversity suggest that there exists only weak correlation between diversity and ensemble accuracy. We show that by combining the diversities with the classifica...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
HPDC
1998
IEEE
15 years 11 months ago
Extending Metasystem Functionality Using Reflection
To support a vast set of user requirements, flexibility and extensibility are essential features of a metasystem architecture. We present an execution model, the Reflective Graph ...
Anh Nguyen-Tuong, Steve J. Chapin, Andrew S. Grims...