Sciweavers

247 search results - page 12 / 50
» Scalable propagation-based call graph construction algorithm...
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
A Locating-First Approach for Scalable Overlay Multicast
— Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rel...
Mohamed Ali Kâafar, Thierry Turletti, Walid ...
IJCAI
2007
13 years 9 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
ISMIS
1997
Springer
13 years 11 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 2 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 25 days ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki