8 search results - page 2 / 2 » Construction of Large Families of Pseudorandom Subsets of th... |
ICSE
1997
IEEE-ACM
13 years 9 months ago
1997
IEEE-ACM
-- Reuse of large-grain software components offers the potential for significant savings in application development cost and time. Successful component reuse and substitutability ...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...