169 search results - page 12 / 34 » Counting paths in digraphs |
DOCENG
2009
ACM
14 years 4 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
MOBIQUITOUS
2005
IEEE
14 years 3 months ago
2005
IEEE
Previous work analytically showed that communication path length reduction is an efficient way for improving the performance of Bluetooth scatternets. Maintaining short communica...
APNOMS
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...