Sciweavers

545 search results - page 48 / 109
» A Hierarchy Based on Output Multiplicity
Sort
View
DLOG
2001
14 years 11 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
FCCM
1998
IEEE
169views VLSI» more  FCCM 1998»
15 years 2 months ago
Scalable Network Based FPGA Accelerators for an Automatic Target Recognition Application
Abstract Image processing, specifically Automatic Target Recognition (ATR) in Synthetic Aperture Radar (SAR) imagery, is an application area that can require tremendous processing ...
Ruth Sivilotti, Young Cho, Wen-King Su, Danny Cohe...
ICASSP
2011
IEEE
14 years 1 months ago
Parallel computation of adaptive lattice filters
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Dong-hwan Lee, Wonyong Sung
ICASSP
2011
IEEE
14 years 1 months ago
Estimating Sparse MIMO channels having Common Support
We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Innovation (FRI) sampling. In this setup, theoretical low...
Yann Barbotin, Ali Hormati, Sundeep Rangan, Martin...
ICPR
2008
IEEE
15 years 4 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
Abdolreza Mirzaei, Mohammad Rahmati