Sciweavers

934 search results - page 131 / 187
» Quantum Algorithmic Entropy
Sort
View
CIKM
2005
Springer
14 years 3 months ago
Establishing value mappings using statistical models and user feedback
In this paper, we present a “value mapping” algorithm that does not rely on syntactic similarity or semantic interpretation of the values. The algorithm first constructs a st...
Jaewoo Kang, Tae Sik Han, Dongwon Lee, Prasenjit M...
ICML
2006
IEEE
14 years 10 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
BMCBI
2010
132views more  BMCBI 2010»
13 years 9 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 1 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
JMLR
2008
159views more  JMLR 2008»
13 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin