Sciweavers

2434 search results - page 94 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
132
Voted
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 3 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
PAMI
2008
198views more  PAMI 2008»
15 years 3 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
208
Voted
BMCBI
2006
198views more  BMCBI 2006»
15 years 3 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
SOFSEM
2001
Springer
15 years 7 months ago
How Can Computer Science Contribute to Knowledge Discovery?
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
Osamu Watanabe
151
Voted
BMCBI
2007
179views more  BMCBI 2007»
15 years 3 months ago
rMotifGen: random motif generator for DNA and protein sequences
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
Eric C. Rouchka, C. Timothy Hardin