1538 search results - page 61 / 308 » Spectral Techniques in Graph Algorithms |
104
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
CCGRID
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
119
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
134
click to vote
GD
2003
Springer
15 years 6 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
109
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
: This paper presents a robust phase correlation based sub-pixel feature matching technique and its application in motion flow estimation, pixel-to-pixel image-co-registration and ...