13500 search results - page 191 / 2700 » Improved analysis of D |
168
click to vote
TIT
2008
15 years 5 months ago
2008
A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on t...
134
click to vote
EJC
2006
15 years 6 months ago
2006
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
150
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
We demonstrate that regularization can improve feedback in a language modeling framework. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Relevance Fee...
179
click to vote
SOSP
2001
ACM
16 years 3 months ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
175
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The discovery of cis-regulatory modules in metazoan genomes is crucial for understanding the connection between genes and organism diversity. It is important to quanti...