Sciweavers

1282 search results - page 157 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
PEWASUN
2004
ACM
15 years 10 months ago
A framework of secure location service for position-based ad hoc routing
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location i...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
IMC
2005
ACM
15 years 10 months ago
Network Anomography
Anomaly detection is a first and important step needed to respond to unexpected problems and to assure high performance and security in IP networks. We introduce a framework and ...
Yin Zhang, Zihui Ge, Albert G. Greenberg, Matthew ...
UAI
2003
15 years 5 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
INFOCOM
1998
IEEE
15 years 8 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 2 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport