Sciweavers

131 search results - page 7 / 27
» Orthogonal thickness of graphs
Sort
View
SADM
2008
90views more  SADM 2008»
15 years 3 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
VISSYM
2003
15 years 5 months ago
A Robust Level-Set Algorithm for Centerline Extraction
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthog...
Alexandru Telea, Anna Vilanova
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 10 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
ASPDAC
2009
ACM
143views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Statistical modeling and analysis of chip-level leakage power by spectral stochastic method
In this paper, we present a novel statistical full-chip leakage power analysis method. The new method can provide a general framework to derive the full-chip leakage current or po...
Ruijing Shen, Ning Mi, Sheldon X.-D. Tan, Yici Cai...
ISCAS
2008
IEEE
140views Hardware» more  ISCAS 2008»
15 years 10 months ago
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract)
arallel Graphs (Extended Abstract) Satoshi Tayu, Kumiko Nomura, and Shuichi Ueno Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-...
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno