Sciweavers

7 search results - page 1 / 2
» A New Technique for Analyzing Substructures in Arrangements
Sort
View
COMPGEOM
1995
ACM
14 years 2 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
MM
2000
ACM
112views Multimedia» more  MM 2000»
14 years 3 months ago
How to bypass the Wassenaar arrangement: a new application for watermarking
The scope of this article is to clarify the current legal and political situation related to electronic surveillance on the one hand, and to export regulations for encryption soft...
Franck Leprévost, Raphaël Erard, Toura...
TSMC
1998
109views more  TSMC 1998»
13 years 10 months ago
Using graph parsing for automatic graph drawing
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
Carolyn McCreary, Richard Chapman, Fwu-Shan Shieh
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 9 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
ICCAD
1996
IEEE
164views Hardware» more  ICCAD 1996»
14 years 3 months ago
A novel dimension reduction technique for the capacitance extraction of 3D VLSI interconnects
In this paper, we present a new capacitance extraction method named Dimension Reduction Technique (DRT) for 3D VLSI interconnects. The DRT converts a complex 3D problem into a ser...
Wei Hong II, Weikai Sun, Zhenhai Zhu, Hao Ji, Ben ...