Sciweavers

1802 search results - page 133 / 361
» Complexity Theory for Operators in Analysis
Sort
View
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 10 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 8 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
TSP
2008
99views more  TSP 2008»
15 years 6 months ago
Sphere Decoding With a Probabilistic Tree Pruning
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
Byonghyo Shim, Insung Kang
ICCV
2009
IEEE
1188views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Actionable Information in Vision
I propose a notion of visual information as the complexity not of the raw images, but of the images after the effects of nuisance factors such as viewpoint and illumination are dis...
Stefano Soatto
SAC
2006
ACM
16 years 10 days ago
Grouping and aggregation in the concept-oriented data model
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...
Alexandr A. Savinov