3724 search results - page 367 / 745 » Timed regular expressions |
201
click to vote
NDSS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
209
Voted
JCSS
2008
15 years 6 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
172
click to vote
QUESTA
2006
15 years 6 months ago
2006
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
196
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Reverse-engineering regulatory networks is one of the central challenges for computational biology. Many techniques have been developed to accomplish this by utilizing...