Sciweavers

77 search results - page 7 / 16
» Robust Subgraphs for Trees and Paths
Sort
View
JCO
2007
128views more  JCO 2007»
13 years 7 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
INFOCOM
2012
IEEE
11 years 9 months ago
Robust multi-source network tomography using selective probes
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
Akshay Krishnamurthy, Aarti Singh
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
BROADNETS
2006
IEEE
14 years 1 months ago
Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks
Abstract— In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting pr...
D. Agrawal, Tamma Bheemarjuna Reddy, C. Siva Ram M...
ICIAP
2009
ACM
13 years 5 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun