Sciweavers

215 search results - page 39 / 43
» Practical Implications of New Results in Conservation of Opt...
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
BMCBI
2006
201views more  BMCBI 2006»
13 years 7 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
PKDD
2010
Springer
212views Data Mining» more  PKDD 2010»
13 years 5 months ago
Cross Validation Framework to Choose amongst Models and Datasets for Transfer Learning
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
ErHeng Zhong, Wei Fan, Qiang Yang, Olivier Versche...
CVPR
2012
IEEE
11 years 9 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
CORR
2007
Springer
90views Education» more  CORR 2007»
13 years 7 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman