8825 search results - page 248 / 1765 » All for one or one for all |
118
click to vote
NETWORKS
2006
15 years 1 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
121
click to vote
ISCI
2007
15 years 1 months ago
2007
In this paper, we propose a novel spatial mining algorithm, called 9DLT-Miner, to mine the spatial association rules from an image database, where every image is represented by th...
103
click to vote
JCT
2007
15 years 1 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
JSAC
2007
15 years 1 months ago
2007
— Various results to date have demonstrated the advantages of one or several relay nodes assisting transmissions in a wireless network. In many practical scenarios, not all nodes...
118
click to vote
JSAC
2007
15 years 1 months ago
2007
Abstract— We consider both the single-user and the multiuser power allocation problems in MIMO systems, where the receiver side has the perfect channel state information (CSI), a...