Sciweavers

240 search results - page 25 / 48
» Forest for the trees
Sort
View
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
14 years 12 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
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
15 years 1 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
CN
2004
114views more  CN 2004»
14 years 11 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
CVPR
2006
IEEE
16 years 1 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, ...
EUC
2008
Springer
15 years 1 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...