10608 search results - page 4 / 2122 » Complexity of O'Hara's Algorithm |
AICT
2005
IEEE
14 years 1 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
BMCBI
2008
2008
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
13 years 7 months ago
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
ICIP
2005
IEEE
14 years 1 months ago
2005
IEEE
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
WIA
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...