1591 search results - page 75 / 319 » Random lifts of graphs |
177
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
155
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
164
click to vote
APPROX
2009
Springer
16 years 27 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
126
click to vote
APAL
2008
15 years 6 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
165
click to vote
CPC
2006
15 years 6 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...