Sciweavers

3825 search results - page 248 / 765
» More on pooling spaces
Sort
View
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
ECML
2006
Springer
15 years 10 months ago
Graph Based Semi-supervised Learning with Sharper Edges
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
Hyunjung Shin, N. Jeremy Hill, Gunnar Rätsch
EMO
2006
Springer
173views Optimization» more  EMO 2006»
15 years 10 months ago
Differential Evolution versus Genetic Algorithms in Multiobjective Optimization
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Tea Tusar, Bogdan Filipic
ICSE
2000
IEEE-ACM
15 years 10 months ago
Holmes: a system to support software product lines
Software product lines are multiple systems that are developed synergistically in an attempt to exploit scope economies. They are a promising approach to more effectively developi...
Giancarlo Succi, Jason Yip, Eric Liu, Witold Pedry...
CSL
1995
Springer
15 years 10 months ago
Improved Decision Procedures for the Modal Logics K, T, and S4
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
Jörg Hudelmaier