Sciweavers

4539 search results - page 95 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICC
2007
IEEE
15 years 4 months ago
A Low-Complexity Path Metric for Tree-Based Multiple-Antenna Detectors
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
Christian Kuhn, Norbert Görtz
IWANN
2009
Springer
15 years 4 months ago
General Purpose Agent-Based Parallel Computing
Parallel computing has become an important research field in the last years. The availability of hardware and the success of grid computing have motivated this interest. In this pa...
David Sánchez, David Isern, Ángel Ro...
CISS
2008
IEEE
15 years 4 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
CISST
2003
83views Hardware» more  CISST 2003»
14 years 11 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
HAPTICS
2008
IEEE
14 years 11 months ago
Surface Contact Interaction with Dynamically Deformable Object Using Impulse-Based Approach
In our previous study, a method that allows dynamic interaction with an elastic object, which is called impulse response deformation model, has been proposed. An advantage of the m...
Kazuyoshi Tagawa, Koichi Hirota, Michitaka Hirose