Sciweavers

18090 search results - page 146 / 3618
» Computing by Only Observing
Sort
View
NDSS
2009
IEEE
16 years 1 months ago
RAINBOW: A Robust And Invisible Non-Blind Watermark for Network Flows
Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to r...
Amir Houmansadr, Negar Kiyavash, Nikita Borisov
ICDCS
2006
IEEE
16 years 10 days ago
Stable and Accurate Network Coordinates
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
Jonathan Ledlie, Peter R. Pietzuch, Margo I. Seltz...
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 11 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
OOPSLA
2005
Springer
15 years 11 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...
AMAI
2004
Springer
15 years 11 months ago
A Framework for Sequential Planning in Multi-Agent Settings
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
Piotr J. Gmytrasiewicz, Prashant Doshi