Sciweavers

136 search results - page 22 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
APVIS
2006
13 years 9 months ago
Visualizing multivariate network on the surface of a sphere
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
Yingxin Wu, Masahiro Takatsuka
ICASSP
2008
IEEE
14 years 2 months ago
Multi-source DOA estimation in a reverberant room
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
Andreas M. Ali, Ralph E. Hudson, Kung Yao
ISNN
2007
Springer
14 years 1 months ago
Fast Code Detection Using High Speed Time Delay Neural Networks
This paper presents a new approach to speed up the operation of time delay neural networks for fast code detection. The entire data are collected together in a long vector and then...
Hazem M. El-Bakry, Nikos E. Mastorakis
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 5 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano