Sciweavers

1510 search results - page 114 / 302
» Upper Probabilities and Additivity
Sort
View
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
15 years 3 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
ICT
2004
Springer
130views Communications» more  ICT 2004»
15 years 3 months ago
Rayleigh Fading Multiple Access Channel Without Channel State Information
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
Ninoslav Marina
ICPP
2003
IEEE
15 years 3 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
IPCO
1992
112views Optimization» more  IPCO 1992»
14 years 11 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
PAMI
2008
181views more  PAMI 2008»
14 years 10 months ago
Automatic Estimation and Removal of Noise from a Single Image
Image denoising algorithms often assume an additive white Gaussian noise (AWGN) process that is independent of the actual RGB values. Such approaches cannot effectively remove colo...
Ce Liu, Richard Szeliski, Sing Bing Kang, C. Lawre...