Sciweavers

1983 search results - page 175 / 397
» Competitive graph searches
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
INFOVIS
2003
IEEE
14 years 1 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...
ARC
2007
Springer
102views Hardware» more  ARC 2007»
14 years 2 days ago
Reconfigurable Hardware Acceleration of Canonical Graph Labelling
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
David B. Thomas, Wayne Luk, Michael Stumpf
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 6 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
ICDAR
2011
IEEE
12 years 7 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal