1949 search results - page 113 / 390 » Random graphs on surfaces |
159
click to vote
DCG
2011
14 years 11 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
128
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
153
click to vote
MST
2010
15 years 2 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
117
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we propose a new methodology for detecting lane markers that exploits the parallel nature of lane boundaries on the road. First, the input image is pre-processed an...
139
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...