Sciweavers

3946 search results - page 681 / 790
» The computational complexity of choice sets
Sort
View
JBI
2008
15 years 6 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
JEI
2008
93views more  JEI 2008»
15 years 6 months ago
Novel workflow for image-guided gamut mapping
We introduce a novel workflow that will hopefully open new directions of processing and improvement in image reproduction. Existing gamut mapping algorithms can be classified into ...
Asaf Golan, Hagit Hel-Or
DKE
2007
105views more  DKE 2007»
15 years 6 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
PRL
2008
213views more  PRL 2008»
15 years 6 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...