Sciweavers

819 search results - page 16 / 164
» Parallelization with Tree Skeletons
Sort
View
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
13 years 8 months ago
An optimal labeling scheme for workflow provenance using skeleton labels
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Su...
CG
2008
Springer
13 years 10 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
CGF
1998
104views more  CGF 1998»
13 years 8 months ago
Animation of Biological Organ Growth Based on L-systems
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita
CGI
2004
IEEE
14 years 6 days ago
BlobTree Trees
In recent years several methods for modeling botanical trees have been proposed. The geometry and topology of tree skeletons can be well described by L-systems; however, there are...
Callum Galbraith, Peter MacMurchy, Brian Wyvill
JDA
2006
87views more  JDA 2006»
13 years 8 months ago
A 3-approximation for the pathwidth of Halin graphs
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
Fedor V. Fomin, Dimitrios M. Thilikos