450 search results - page 43 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
104
click to vote
DSN
2004
IEEE
15 years 3 months ago
2004
IEEE
If we limit the contact rate of worm traffic, can we alleviate and ultimately contain Internet worms? This paper sets out to answer this question. Specifically, we are interested ...
120
click to vote
DEXA
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
119
click to vote
RIVF
2008
15 years 1 months ago
2008
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
134
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
100
click to vote
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...