Sciweavers

4679 search results - page 42 / 936
» Modeling When Connections Are the Problem
Sort
View
ESANN
2000
15 years 2 months ago
An algorithm for the addition of time-delayed connections to recurrent neural networks
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
Romuald Boné, Michel Crucianu, Jean Pierre ...
MICCAI
2005
Springer
16 years 2 months ago
An Automated Approach to Connectivity-Based Partitioning of Brain Structures
Abstract. We present an automated approach to the problem of connectivity-based partitioning of brain structures using diffusion imaging. White-matter fibres connect different area...
Philip A. Cook, Hui Zhang 0005, Brian B. Avants, P...
ROBOCOMM
2007
IEEE
15 years 7 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
PIMRC
2010
IEEE
14 years 11 months ago
Connectivity in wireless networks with dynamic key compromise and recovery
Abstract--This paper considers the problem of key management in wireless networks. In particular, we investigate the effect of dynamic key compromise and recovery on connectivity i...
Satashu Goel, Aylin Yener
INFOCOM
2009
IEEE
15 years 8 months ago
On Leveraging Partial Paths in Partially-Connected Networks
Abstract—Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either ...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...