Sciweavers

1381 search results - page 145 / 277
» Structural signatures for tree data structures
Sort
View
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
14 years 8 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
IFIP12
2008
14 years 11 months ago
Bayesian Networks Optimization Based on Induction Learning Techniques
Obtaining a bayesian network from data is a learning process that is divided in two steps: structural learning and parametric learning. In this paper, we define an automatic learni...
Paola Britos, Pablo Felgaer, Ramón Garc&iac...
AINA
2009
IEEE
15 years 4 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 4 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
COGSCI
2004
148views more  COGSCI 2004»
14 years 9 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey