Sciweavers

5889 search results - page 43 / 1178
» Graph Layout Problems
Sort
View
CCCG
2006
13 years 11 months ago
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
R. Sharathkumar, Prosenjit Gupta
TCAD
2002
135views more  TCAD 2002»
13 years 9 months ago
Area fill synthesis for uniform layout density
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and interconnect features, depending on local character...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
DAM
2011
13 years 4 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
APVIS
2009
13 years 11 months ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber
ICPR
2008
IEEE
14 years 11 months ago
Tailoring text for automatic layouting of newspaper pages
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
Leonhard Hennig, Thomas Strecker