Sciweavers

4137 search results - page 138 / 828
» On the number of matchings of a tree
Sort
View
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
16 years 3 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
15 years 6 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson
CPC
2006
69views more  CPC 2006»
15 years 6 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
CGF
1998
142views more  CGF 1998»
15 years 6 months ago
Tree Visualisation and Navigation Clues for Information Visualisation
Information visualisation often requires good navigation aids on large trees, which represent the underlying information. Using trees for information visualisation requires novel ...
Ivan Herman, Maylis Delest, Guy Melançon
WWW
2005
ACM
16 years 7 months ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling