Sciweavers

189 search results - page 16 / 38
» SCARAB: scaling reachability computation on large graphs
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
CVPR
2012
IEEE
13 years 1 days ago
Scalable k-NN graph construction for visual descriptors
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, R...
P2P
2007
IEEE
104views Communications» more  P2P 2007»
15 years 3 months ago
How stable are large superpeer networks against attack?
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
Bivas Mitra, Sujoy Ghose, Niloy Ganguly
ICCV
2009
IEEE
14 years 7 months ago
Building recognition using sketch-based representations and spectral graph matching
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
Yu-Chia Chung, Tony X. Han, Zhihai He
ECCV
2002
Springer
15 years 11 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...