697 search results - page 98 / 140 » On the Theory of Average Case Complexity |
NIPS
2007
13 years 9 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose a new resource allocation mechanism which is designed to improve the multiuser detection of wireless network diversity multiple access (NDMA) protocol...
ASAP
2005
IEEE
14 years 1 months ago
2005
IEEE
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
ICALP
1993
Springer
14 years 3 days ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
STACS
1992
Springer
14 years 1 days ago
1992
Springer
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...