Sciweavers

2168 search results - page 97 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
TIT
2010
107views Education» more  TIT 2010»
14 years 10 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
SIGIR
2009
ACM
15 years 9 months ago
An improved markov random field model for supporting verbose queries
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
Matthew Lease
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
15 years 9 months ago
Transient analysis of tree-Like processes and its application to random access systems
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
15 years 8 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
RECOMB
2004
Springer
16 years 3 months ago
Interface surfaces for protein-protein complexes
Protein-protein interactions, which form the basis for most cellular processes, result in the formation of protein interfaces. Believing that the local shape of proteins is crucia...
Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes ...