Sciweavers

530 search results - page 50 / 106
» Universal randomized switching
Sort
View
TIT
2002
129views more  TIT 2002»
15 years 3 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
TIT
2010
122views Education» more  TIT 2010»
14 years 10 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
ICMB
2005
IEEE
79views Business» more  ICMB 2005»
15 years 9 months ago
Identity Management in Vertical Handovers for UMTS-WLAN Networks
One motivation of mobile Next-Generation Networks (NGN) is the ubiquitous computing abilities, which provide automatic handovers for any moving computing devices in a globally net...
Mo Li, Kumbesan Sandrasegaran, Xiaoan Huang
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
15 years 3 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 4 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle