2079 search results - page 68 / 416 » Universality of random graphs |
131
click to vote
WWW
2008
ACM
16 years 4 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...
124
click to vote
CP
2004
Springer
15 years 9 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...
127
click to vote
EMNLP
2007
15 years 5 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...
107
Voted
STOC
1992
ACM
15 years 8 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
114
click to vote
SIAMDM
2008
15 years 4 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)