Sciweavers

1095 search results - page 18 / 219
» Preprocessing of Intractable Problems
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 8 months ago
Lattice problems and norm embeddings
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
Oded Regev, Ricky Rosen
BICOB
2009
Springer
14 years 2 months ago
Association Analysis Techniques for Bioinformatics Problems
Association analysis is one of the most popular analysis paradigms in data mining. Despite the solid foundation of association analysis and its potential applications, this group o...
Gowtham Atluri, Rohit Gupta, Gang Fang, Gaurav Pan...
HIS
2008
13 years 9 months ago
Evolutionary Training Set Selection to Optimize C4.5 in Imbalanced Problems
Classification in imbalanced domains is a recent challenge in machine learning. We refer to imbalanced classification when data presents many examples from one class and few from ...
Salvador García, Francisco Herrera
IDA
2009
Springer
14 years 2 months ago
Bayesian Robust PCA for Incomplete Data
Abstract. We present a probabilistic model for robust principal component analysis (PCA) in which the observation noise is modelled by Student-t distributions that are independent ...
Jaakko Luttinen, Alexander Ilin, Juha Karhunen
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
14 years 2 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich