16404 search results - page 2555 / 3281 » A set coverage problem |
180
click to vote
VMCAI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...
182
click to vote
WABI
2007
Springer
16 years 1 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
154
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
200
click to vote
WEBI
2007
Springer
16 years 1 months ago
2007
Springer
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set ...
168
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...