Sciweavers

2304 search results - page 193 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICDAR
2009
IEEE
15 years 4 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
ACCV
2010
Springer
15 years 1 months ago
Linear Solvability in the Viewing Graph
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Alessandro Rudi, Matia Pizzoli, Fiora Pirri
TIP
2011
164views more  TIP 2011»
15 years 1 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
INFOCOM
2012
IEEE
13 years 9 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 9 months ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...