7913 search results - page 374 / 1583 » Information Collection on a Graph |
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
122
click to vote
ACSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
108
click to vote
HPDC
1998
IEEE
15 years 8 months ago
1998
IEEE
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
164
click to vote
ICDE
2007
IEEE
15 years 8 months ago
2007
IEEE
"Software as a service" approach has become a reality since efforts of both industry and research focused on service integration on the web. It would be possible to see ...
124
click to vote
DM
2008
15 years 4 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...