Sciweavers

10608 search results - page 276 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
82
Voted
BC
2006
83views more  BC 2006»
15 years 19 days ago
An Algorithmic Method for Reducing Conductance-based Neuron Models
Although conductance-based neural models provide a realistic depiction of neuronal activity, their complexity often limits effective implementation and analysis. Neuronal model red...
Michael E. Sorensen, Stephen P. DeWeerth
116
Voted
TWC
2010
14 years 7 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICASSP
2011
IEEE
14 years 4 months ago
Adaptive MIMO detection algorithm by jointly exploiting the properties of signal and channel
The purpose of this paper is to develop an algorithm achieving the performance of fixed-complexity decoder (FSD) with much lower complexity than FSD. An adaptive expansion strate...
Yuehua Ding, Yide Wang, Jean-Francois Diouris
109
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
93
Voted
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
16 years 28 days ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj