Sciweavers

824 search results - page 72 / 165
» Weighted Low-Rank Approximations
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
WCNC
2010
IEEE
15 years 1 months ago
Representation of Composite Fading and Shadowing Distributions by Using Mixtures of Gamma Distributions
Abstract—The Nakagami-lognormal distribution is the commonly used composite distribution for modeling multipath fading and shadowing. In this paper1 , simple and new form of dist...
Saman Atapattu, Chintha Tellambura, Hai Jiang
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 1 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
14 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
NIPS
1994
14 years 11 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad