2080 search results - page 36 / 416 » Measuring empirical computational complexity |
135
click to vote
CCGRID
2007
IEEE
15 years 8 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
15 years 6 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...
100
Voted
SDM
2009
SIAM
15 years 11 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...
104
click to vote
ICML
2008
IEEE
16 years 2 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
15 years 5 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...