Sciweavers

621 search results - page 56 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
CN
2008
138views more  CN 2008»
13 years 8 months ago
Analysis of bandwidth efficiency in overlay multicasting
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...
Changhan Kim, Younghoon Kim, Jae-Heon Yang, Ikjun ...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
CIKM
2008
Springer
13 years 10 months ago
PROQID: partial restarts of queries in distributed databases
In a number of application areas, distributed database systems can be used to provide persistent storage of data while providing efficient access for both local and remote data. W...
Jon Olav Hauglid, Kjetil Nørvåg
SODA
2000
ACM
83views Algorithms» more  SODA 2000»
13 years 9 months ago
Restructuring ordered binary trees
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
William S. Evans, David G. Kirkpatrick
ICML
2006
IEEE
14 years 8 months ago
Bayesian pattern ranking for move prediction in the game of Go
We investigate the problem of learning to predict moves in the board game of Go from game records of expert players. In particular, we obtain a probability distribution over legal...
David H. Stern, Ralf Herbrich, Thore Graepel