Sciweavers

729 search results - page 65 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
CCR
2004
94views more  CCR 2004»
13 years 10 months ago
Honeycomb: creating intrusion detection signatures using honeypots
Abstract-- This paper describes a system for automated generation of attack signatures for network intrusion detection systems. Our system applies pattern-matching techniques and p...
Christian Kreibich, Jon Crowcroft
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 10 months ago
Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
Laurent Najman
JOLLI
2010
85views more  JOLLI 2010»
13 years 8 months ago
Information Tracking in Games on Graphs
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
Dietmar Berwanger, Lukasz Kaiser
TMC
2011
213views more  TMC 2011»
13 years 5 months ago
Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing
Abstract—We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provid...
R. J. La, Eunyoung Seo
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 5 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...