1542 search results - page 76 / 309 » The metamathematics of random graphs |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
EMNLP
2007
14 years 11 months ago
2007
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
SIAMDM
2008
14 years 9 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
WAW
2009
Springer
15 years 4 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...