1963 search results - page 182 / 393 » The Maximum Solution Problem on Graphs |
136
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
128
click to vote
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
116
click to vote
HM
2007
Springer
15 years 9 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
122
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
106
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...