10608 search results - page 64 / 2122 » Complexity of O'Hara's Algorithm |
IPL
2006
13 years 10 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
GD
2004
Springer
14 years 3 months ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
ICA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
SG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...
ICRA
1993
IEEE
14 years 2 months ago
1993
IEEE
In this paper we introduce a formalism which combines reliability and complexity as performance measures for Intelligent Machines. For a given desired reliability, di erent algori...