Sciweavers

6365 search results - page 45 / 1273
» Fast Local Computation Algorithms
Sort
View
182
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
88
Voted
FIMH
2005
Springer
15 years 6 months ago
Fast Spatio-temporal Free-Form Registration of Cardiac MR Image Sequences
Abstract. In this paper we present a novel approach to the problem of spatiotemporal alignment of cardiac MR image sequences. This novel method has the ability to correct spatial m...
Dimitrios Perperidis, Raad Mohiaddin, Daniel Rueck...
104
Voted
IROS
2006
IEEE
134views Robotics» more  IROS 2006»
15 years 6 months ago
A Novel Self Organizing Network to Perform Fast Moving Object Extraction from Video Streams
— Image segmentation is a critical task in computer vision. In the context of motion detection, a very popular segmentation approach is background substraction which consists in ...
Dizan Vasquez, Thierry Fraichard
92
Voted
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 9 months ago
A Probabilistic-Based Design Methodology for Nanoscale Computation
As current silicon-based techniques fast approach their practical limits, the investigation of nanoscale electronics, devices and system architectures becomes a central research p...
R. Iris Bahar, Joseph L. Mundy, Jie Chen
ISICA
2007
Springer
15 years 6 months ago
A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Changhe Li, Yong Liu, Aimin Zhou, Lishan Kang, Hui...