Sciweavers

1407 search results - page 183 / 282
» Systems Theory Model for Information Security
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 2 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 9 months ago
Overcoming limitations of game-theoretic distributed control
—Recently, game theory has been proposed as a tool for cooperative control. Specifically, the interactions of a multiagent distributed system are modeled as a non-cooperative ga...
Jason R. Marden, Adam Wierman
TCS
2010
15 years 2 months ago
Analyzing the dynamics of stigmergetic interactions through pheromone games
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
Peter Vrancx, Katja Verbeeck, Ann Nowé
IMC
2009
ACM
15 years 11 months ago
ANTIDOTE: understanding and defending against poisoning of anomaly detectors
Statistical machine learning techniques have recently garnered increased popularity as a means to improve network design and security. For intrusion detection, such methods build ...
Benjamin I. P. Rubinstein, Blaine Nelson, Ling Hua...
BMCBI
2008
149views more  BMCBI 2008»
15 years 4 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
Olivier Bastien, Eric Maréchal