Sciweavers

8298 search results - page 66 / 1660
» On the Complexity of Numerical Analysis
Sort
View
MICCAI
2010
Springer
15 years 4 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
15 years 3 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
ICC
2009
IEEE
15 years 3 months ago
Performance Evaluation of QAM-Based BICM: An Analytical Approach
We present an analytical approach to determine the performance of bit-interleaved coded modulation (BICM) transmission over unfaded Gaussian channels. In particular, we derive expr...
Alireza Kenarsari-Anhari, Lutz H.-J. Lampe
ISDA
2006
IEEE
16 years 4 days ago
Finding Groups in Data: Cluster Analysis with Ants
We present in this paper a modification of Lumer and Faieta’s algorithm for data clustering. This algorithm discovers automatically clusters in numerical data without prior kno...
Urszula Boryczka
JAIR
2011
123views more  JAIR 2011»
15 years 1 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...