Sciweavers

15485 search results - page 81 / 3097
» Computing Optimal Subsets
Sort
View
GECCO
2007
Springer
141views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving robust GP solutions for hedge fund stock selection in emerging markets
Abstract Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive)...
Wei Yan, Christopher D. Clack
IANDC
2007
106views more  IANDC 2007»
13 years 7 months ago
Extended visual cryptography schemes
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image ...
Andreas Klein, Markus Wessler
JMLR
2010
109views more  JMLR 2010»
13 years 2 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
KDD
2000
ACM
142views Data Mining» more  KDD 2000»
13 years 11 months ago
Automating exploratory data analysis for efficient data mining
Having access to large data sets for the purpose of predictive data mining does not guarantee good models, even when the size of the training data is virtually unlimited. Instead,...
Jonathan D. Becher, Pavel Berkhin, Edmund Freeman
ICCV
2009
IEEE
15 years 21 days ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey