2080 search results - page 36 / 416 » Measuring empirical computational complexity |
CCGRID
2007
IEEE
14 years 4 months ago
2007
IEEE
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
ECML
1998
Springer
14 years 2 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
CANDT
2009
14 years 1 months ago
2009
Self-focus is a novel way of understanding a type of bias in community-maintained Web 2.0 graph structures. It goes beyond previous measures of topical coverage bias by encapsulat...