Sciweavers

303 search results - page 38 / 61
» Incentive analysis of approximately efficient allocation alg...
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
NIPS
2004
13 years 9 months ago
Following Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
Saharon Rosset
PE
2006
Springer
145views Optimization» more  PE 2006»
13 years 7 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...