Sciweavers

1697 search results - page 63 / 340
» On Bayesian Case Matching
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
ICML
2005
IEEE
14 years 10 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
14 years 1 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 5 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
KES
2007
Springer
14 years 3 months ago
Credal Networks for Operational Risk Measurement and Management
According to widely accepted guidelines for self-regulation, the capital requirements of a bank should relate to the level of risk with respect to three different categories. Amon...
Alessandro Antonucci, Alberto Piatti, Marco Zaffal...