451 search results - page 12 / 91 » Relationless Completeness and Separations |
MST
2010
14 years 8 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
SIP
2003
2003
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
14 years 11 months ago
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
61
Voted
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
Inspired by a converse result, the concept of "probabilistically matched" sources and channels is extended to sources subject to multiresolution coding and degraded broa...
56
Voted
CVPR
1997
IEEE
15 years 1 months ago
1997
IEEE
ÐThe detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion ener...