Sciweavers

1284 search results - page 94 / 257
» Connectivity in Bag Generation
Sort
View
ADHOC
2007
107views more  ADHOC 2007»
15 years 6 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
ARSCOM
2008
117views more  ARSCOM 2008»
15 years 6 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
JGT
2008
150views more  JGT 2008»
15 years 6 months ago
Cycle spaces in topological spaces
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Antoine Vella, R. Bruce Richter
CCR
2004
94views more  CCR 2004»
15 years 6 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
DAM
1999
77views more  DAM 1999»
15 years 6 months ago
Compound Constructions of Broadcast Networks
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilso...