3353 search results - page 238 / 671 » Laver and set theory |
162
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
143
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring variab...
200
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
166
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...