Sciweavers

394 search results - page 59 / 79
» Testing subgraphs in large graphs
Sort
View
WWW
2008
ACM
14 years 8 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
SC
2005
ACM
14 years 1 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
ICCV
1998
IEEE
14 years 9 months ago
View-Based Object Matching
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson
CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 7 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis