Sciweavers

240 search results - page 29 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
CACM
2010
105views more  CACM 2010»
13 years 8 months ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
13 years 8 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer
JIB
2006
78views more  JIB 2006»
13 years 8 months ago
Prediction of transcription factor binding to DNA using rule induction methods
In this study, we seek to develop a predictive model for finding the strength of binding between a particular transcription factor (TF) variant and a particular DNA target variant...
Mikael Huss, Karin Nordström
JMLR
2006
120views more  JMLR 2006»
13 years 8 months ago
Kernel-Based Learning of Hierarchical Multilabel Classification Models
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
Juho Rousu, Craig Saunders, Sándor Szedm&aa...
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 9 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...