Sciweavers

829 search results - page 98 / 166
» Bandit Algorithms for Tree Search
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 18 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
JCB
2007
136views more  JCB 2007»
14 years 9 months ago
A Structure-Based Flexible Search Method for Motifs in RNA
The discovery of non-coding RNA (ncRNA) motifs and their role in regulating gene expression has recently attracted considerable attention. The goal is to discover these motifs in ...
Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 10 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
JGTOOLS
2006
111views more  JGTOOLS 2006»
14 years 9 months ago
Stochastic Billboard Clouds for Interactive Foliage Rendering
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
J. Dylan Lacewell, David Edwards, Peter Shirley, W...