463 search results - page 81 / 93 » The lattice dimension of a graph |
RSA
2010
14 years 8 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
PR
2011
14 years 4 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
COLT
1993
Springer
15 years 1 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...