Sciweavers

277 search results - page 7 / 56
» New results on shortest paths in three dimensions
Sort
View
MICS
2008
72views more  MICS 2008»
13 years 7 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
GD
2005
Springer
14 years 1 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
TASLP
2010
128views more  TASLP 2010»
13 years 2 months ago
Three Dimensions of Pitched Instrument Onset Detection
In this paper, we suggest a novel group delay based method for the onset detection of pitched instruments. It is proposed to approach the problem of onset detection by examining th...
Andre Holzapfel, Yannis Stylianou, Ali Cenk Gedik,...
DAC
1996
ACM
13 years 11 months ago
Fast Parameters Extraction of General Three-Dimension Interconnects Using Geometry Independent Measured Equation of Invariance
Measured Equation of Invariance(MEI) is a new concept in computational electromagnetics. It has been demonstrated that the MEI technique can be used to terminate the meshes very c...
Weikai Sun, Wayne Wei-Ming Dai, Wei Hong II