Sciweavers

2498 search results - page 446 / 500
» Algorithms for the Topological Watershed
Sort
View
JCM
2007
131views more  JCM 2007»
13 years 7 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
HCI
2009
13 years 5 months ago
Mind-Mirror: EEG-Guided Image Evolution
Abstract. We propose a brain-computer interface (BCI) system for evolving images in realtime based on subject feedback derived from electroencephalography (EEG). The goal of this s...
Nima Bigdely Shamlo, Scott Makeig
BMCBI
2011
12 years 11 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus
MOBIHOC
2003
ACM
14 years 7 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
WISEC
2010
ACM
14 years 2 months ago
Timing-based localization of in-band wormhole tunnels in MANETs
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
Jinsub Kim, Dan Sterne, Rommie Hardy, Roshan K. Th...