Sciweavers

5889 search results - page 269 / 1178
» Graph Layout Problems
Sort
View
JCT
2007
95views more  JCT 2007»
15 years 6 months ago
Codegree problems for projective geometries
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
Peter Keevash, Yi Zhao
ISQED
2008
IEEE
117views Hardware» more  ISQED 2008»
16 years 1 months ago
A Basis for Formal Robustness Checking
Correct input/output behavior of circuits in presence of internal malfunctions becomes more and more important. But reliable and efficient methods to measure this robustness are ...
Görschwin Fey, Rolf Drechsler
IV
2007
IEEE
138views Visualization» more  IV 2007»
16 years 28 days ago
Visual Mashup of Text and Media Search Results
There is a growing trend of enabling users to view diverse sources of data in an integrated manner, called visual mashups. This paper addresses the problem of how to visualize div...
Anselm Spoerri
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
16 years 5 days ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
DAC
1998
ACM
15 years 11 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong