Sciweavers

1844 search results - page 293 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
GLOBECOM
2006
IEEE
15 years 5 months ago
A Game Theoretic Approach to Detect Network Intrusions: The Cooperative Intruders Scenario
Abstract— In this paper, we consider the problem of detecting intrusions initiated by cooperative malicious nodes in infrastructure-based networks. We achieve this objective by s...
Mona Mehrandish, Hadi Otrok, Mourad Debbabi, Chadi...
ICASSP
2009
IEEE
15 years 6 months ago
Quickest change detection in multiple on-off processes
A Bayesian formulation of quickest change detection in multiple onoff processes is obtained within a decision-theoretic framework. For geometrically distributed busy and idle time...
Qing Zhao, Jia Ye
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 19 days ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
PODC
2006
ACM
15 years 5 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
IPPS
2000
IEEE
15 years 2 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch