2412 search results - page 307 / 483 » Which Problems Have Strongly Exponential Complexity |
140
Voted
TIT
2010
14 years 10 months ago
2010
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
128
click to vote
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
144
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
124
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
148
Voted
WEBI
2001
Springer
15 years 8 months ago
2001
Springer
As meta-data become of ever more importance to the Web, we will need to start managing such meta-data. We argue that there is a strong need for meta-data validation and aggregation...