358 search results - page 14 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
129
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
162
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
133
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
140
Voted
CCR
2010
15 years 1 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
157
Voted
TC
2011
14 years 10 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...