1949 search results - page 195 / 390 » Random graphs on surfaces |
153
Voted
ECML
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
141
click to vote
IH
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
171
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
136
click to vote
ASIACRYPT
2008
Springer
15 years 7 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
129
Voted
COMBINATORICS
2007
15 years 5 months ago
2007
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...