Sciweavers

42230 search results - page 377 / 8446
» Algorithms and Complexity Results for
Sort
View
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 7 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
FOCS
1990
IEEE
15 years 11 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
IPL
2006
139views more  IPL 2006»
15 years 6 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
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
Morteza Fayyazi, David R. Kaeli, Waleed Meleis
ICA
2004
Springer
16 years 6 days ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
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...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
ICRA
1993
IEEE
101views Robotics» more  ICRA 1993»
15 years 11 months ago
Measuring Complexity of Intelligent Machines
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...
Pedro U. Lima, George N. Saridis