45 search results - page 9 / 9 » Oblivious routing in directed graphs with random demands |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
BROADNETS
2005
IEEE
13 years 11 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
MOBIHOC
2007
ACM
14 years 5 months ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
SISAP
2009
IEEE
14 years 4 days ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
ISI
2006
Springer
13 years 5 months ago
2006
Springer
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...