Sciweavers

3267 search results - page 21 / 654
» Generalized quasirandom graphs
Sort
View
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 8 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
ICCV
2007
IEEE
14 years 9 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
SIGIR
2008
ACM
13 years 7 months ago
A general optimization framework for smoothing language models on graph structures
Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smo...
Qiaozhu Mei, Duo Zhang, ChengXiang Zhai
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
14 years 7 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...