9842 search results - page 1765 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
120
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
This work examines the dendritic cell algorithm (DCA) from a mathematical perspective. By representing the signal processing phase of the algorithm using the dot product it is sho...
152
Voted
GPC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
120
Voted
ICANNGA
2009
Springer
15 years 10 months ago
2009
Springer
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
125
Voted
ICB
2009
Springer
15 years 10 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...