Sciweavers

1060 search results - page 147 / 212
» On the Discovery of Random Trees
Sort
View
96
Voted
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 4 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
83
Voted
SPAA
1997
ACM
15 years 2 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
83
Voted
MTA
2006
115views more  MTA 2006»
14 years 10 months ago
Tree-assisted gossiping for overlay video distribution
Given its readily deployable nature and broad applications for digital entertainment, video streaming through overlay networks has received much attention recently. While a tree to...
Jiangchuan Liu, Ming Zhou
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
110
Voted
PPOPP
2010
ACM
15 years 7 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...