241 search results - page 36 / 49 » Graphs, Hypergraphs and Hashing |
146
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
130
click to vote
ADHOCNETS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
106
click to vote
ACSC
2001
IEEE
15 years 5 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
123
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
147
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...