3240 search results - page 189 / 648 » Pre-aggregation with probability distributions |
151
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
129
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
126
click to vote
ECIR
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic retrieval models usually rank documents based on a scalar quantity. However, such models lack any estimate for the uncertainty associated with a document’s rank. Fu...
109
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
We address the classic wire-length estimation problem and propose a new statistical wire-length estimation approach that captures the probability distribution function of net leng...
124
click to vote
TMA
2010
Springer
15 years 11 months ago
2010
Springer
The paper describes the EmPath tool that was designed to emulate packet transfer characteristics as delays and losses in IP network. The main innovation of this tool is its ability...