Sciweavers

462 search results - page 29 / 93
» Covering a Tree by a Forest
Sort
View
GRC
2009
IEEE
13 years 10 months ago
A step toward code granulation space
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Yinliang Zhao
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
13 years 7 months ago
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
Stephan G. Wagner
CVPR
2006
IEEE
14 years 9 months ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
DATESO
2004
134views Database» more  DATESO 2004»
13 years 8 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
EUC
2008
Springer
13 years 9 months ago
Trusted Spanning Tree for Delay Tolerant MANETs
Quality of service is an important issue in Delay Tolerant Mobile Ad-Hoc Networks (DTMs). This work attempts to improve the Quality of service (QoS) in DTMs by relying on spanning...
Apivadee Piyatumrong, Pascal Bouvry, Fréd&e...