Sciweavers

1370 search results - page 91 / 274
» On grids in topological graphs
Sort
View
IJSYSC
2006
113views more  IJSYSC 2006»
15 years 6 months ago
Neural network approach to collision free path-planning for robotic manipulators
: The paper deals with collision free path planning for industrial robotic manipulators. A new efficient algorithm is proposed that is based on a topologically ordered neural netwo...
Anatoly Pashkevich, M. Kazheunikau, A. E. Ruano
INFOCOM
2006
IEEE
16 years 9 days ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
BMCBI
2011
15 years 1 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura
IJON
2007
81views more  IJON 2007»
15 years 6 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
ICPR
2008
IEEE
16 years 7 months ago
Impulse noise removal by spectral clustering and regularization on graphs
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
Olivier Lezoray, Vinh-Thong Ta, Abderrahim Elmoata...