337 search results - page 31 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
138
Voted
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
136
click to vote
GD
1995
Springer
15 years 5 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
111
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
103
click to vote
ICDAR
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
124
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...