Sciweavers

4137 search results - page 212 / 828
» On the number of matchings of a tree
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 8 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 6 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
ACG
2009
Springer
16 years 1 months ago
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
Markus Enzenberger, Martin Müller 0003
FCT
2005
Springer
16 years 4 days ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...