3757 search results - page 537 / 752 » The overlap number of a graph |
154
click to vote
KES
2007
Springer
16 years 20 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
161
click to vote
TCC
2007
Springer
16 years 19 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
145
click to vote
WABI
2007
Springer
16 years 19 days ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
177
click to vote
ICDM
2006
IEEE
16 years 17 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
262
click to vote
ICPP
2006
IEEE
16 years 17 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...