1225 search results - page 39 / 245 » Maximal Consistent Subsets |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A K-user memoryless interference channel is considered where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated t...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— We address data transmission over the M-user Gaussian interference channel, where users send data using single Gaussian codebooks. We first present a polynomial-time algorithm...
TWC
2008
13 years 7 months ago
2008
In a wireless multiple-input multiple-output (MIMO) system, transmit antenna selection is an effective means of achieving good performance with low complexity. We consider spatial ...
MOR
2007
13 years 7 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
FIMI
2004
13 years 9 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...