Sciweavers

2286 search results - page 246 / 458
» Algorithms for Categorical Equivalence
Sort
View
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ICASSP
2008
IEEE
16 years 1 months ago
Some results on 16-QAM MIMO detection using semidefinite relaxation
Semidefinite relaxation (SDR) is a high-performance efficient approach to MIMO detection especially for the BPSK or QPSK constellations. Recently, a number of research endeavors...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Chong-Y...
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
16 years 1 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
16 years 1 months ago
Localized Homology
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
Afra Zomorodian, Gunnar Carlsson
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 1 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson