Sciweavers

4110 search results - page 119 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
NIPS
2004
15 years 5 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
NIPS
1998
15 years 5 months ago
Efficient Bayesian Parameter Estimation in Large Discrete Domains
In this paper we examine the problem of estimating the parameters of a multinomial distribution over a large number of discreteoutcomes,most of which do not appearin the training ...
Nir Friedman, Yoram Singer
NIPS
1994
15 years 5 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
BMCBI
2006
109views more  BMCBI 2006»
15 years 4 months ago
HaploRec: efficient and accurate large-scale reconstruction of haplotypes
Background: Haplotypes extracted from human DNA can be used for gene mapping and other analysis of genetic patterns within and across populations. A fundamental problem is, howeve...
Lauri Eronen, Floris Geerts, Hannu Toivonen
ICPR
2010
IEEE
15 years 2 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu