Sciweavers

2412 search results - page 171 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
PIMRC
2008
IEEE
15 years 10 months ago
Radio resource allocation in OFDMA multihop cellular cooperative networks
Multihop cellular networks (MeNs) is an extension of single hop cellular networks (SCNs) having benefits of a fixed base station and flexible ad hoc networks. The radio resource ma...
Cheol Jeong, Hyung-Myung Kim
SC
2009
ACM
15 years 10 months ago
Autotuning multigrid with PetaBricks
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
Cy P. Chan, Jason Ansel, Yee Lok Wong, Saman P. Am...
ISCA
2009
IEEE
152views Hardware» more  ISCA 2009»
15 years 10 months ago
Scaling the bandwidth wall: challenges in and avenues for CMP scaling
As transistor density continues to grow at an exponential rate in accordance to Moore’s law, the goal for many Chip Multi-Processor (CMP) systems is to scale the number of on-ch...
Brian M. Rogers, Anil Krishna, Gordon B. Bell, Ken...
168
Voted
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 6 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 3 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan