Sciweavers

6142 search results - page 39 / 1229
» The Complexity of Partition Functions
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
ICSM
2002
IEEE
15 years 2 months ago
Measuring Software Functional Size: Towards an Effective Measurement of Complexity
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...
De Tran-Cao, Ghislain Lévesque, Alain Abran
TNN
2008
102views more  TNN 2008»
14 years 9 months ago
A Class of Complex ICA Algorithms Based on the Kurtosis Cost Function
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
Hualiang Li, Tülay Adali
GECCO
2004
Springer
15 years 3 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 1 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson