Sciweavers

3356 search results - page 550 / 672
» Thresholds and Expectation Thresholds
Sort
View
TIT
2002
99views more  TIT 2002»
15 years 6 months ago
Feedback strategies for white Gaussian interference networks
A white Gaussian interference network is a channel with transmitters and receivers where the received symbols are linear combinations of the transmitted symbols and white Gaussian ...
Gerhard Kramer
TIT
2002
78views more  TIT 2002»
15 years 6 months ago
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
Tsachy Weissman, Neri Merhav
TOG
2002
102views more  TOG 2002»
15 years 6 months ago
Hierarchical pattern mapping
We present a multi-scale algorithm for mapping a texture defined by an input image onto an arbitrary surface. It avoids the generation and storage of a new, specific texture. The ...
Cyril Soler, Marie-Paule Cani, Alexis Angelidis
TOMACS
2002
113views more  TOMACS 2002»
15 years 6 months ago
Simulating heavy tailed processes using delayed hazard rate twisting
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
Sandeep Juneja, Perwez Shahabuddin
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
15 years 6 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...