Sciweavers

2899 search results - page 117 / 580
» Dynamic Trees in Practice
Sort
View
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 2 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 10 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
MDAI
2005
Springer
14 years 2 months ago
Language Generation for Conversational Agent by Evolution of Plan Trees with Genetic Programming
As dialogue systems are widely demanded, the research on natural language generation in dialogue has raised interest. Contrary to conventional dialogue systems that reply to the us...
Sungsoo Lim, Sung-Bae Cho
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 10 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
AINA
2009
IEEE
14 years 3 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