Sciweavers

511 search results - page 27 / 103
» The intrinsic dimensionality of graphs
Sort
View
BMCBI
2004
126views more  BMCBI 2004»
14 years 11 months ago
Visualising very large phylogenetic trees in three dimensional hyperbolic space
Background: Common existing phylogenetic tree visualisation tools are not able to display readable trees with more than a few thousand nodes. These existing methodologies are base...
Timothy Hughes, Young Hyun, David A. Liberles
GLVLSI
2006
IEEE
115views VLSI» more  GLVLSI 2006»
15 years 5 months ago
Yield enhancement of asynchronous logic circuits through 3-dimensional integration technology
This paper presents a systematic design methodology for yield enhancement of asynchronous logic circuits using 3-D (3-Dimensional) integration technology. In this design, the targ...
Song Peng, Rajit Manohar
IJBC
2007
54views more  IJBC 2007»
14 years 11 months ago
Impact Dynamics of Large Dimensional Systems
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
Martin E. Homer, S. John Hogan
COLT
2006
Springer
15 years 3 months ago
The Rademacher Complexity of Linear Transformation Classes
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
Andreas Maurer
CCCG
2007
15 years 1 months ago
Computing Acute and Non-obtuse Triangulations
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
Hale Erten, Alper Üngör