Sciweavers

15033 search results - page 366 / 3007
» Complexity Theory and Algorithms
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 7 months ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
189
Voted
ICPR
2008
IEEE
16 years 1 months ago
Boosted complex moments for discriminant rotation invariant object recognition
This paper proposes a method for constructing a discriminative rotation invariant object recognition system from the set of complex moments by using a multi-class boosting algorit...
Pew-Thian Yap, Xudong Jiang, Alex ChiChung Kot
149
Voted
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 11 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 11 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 11 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima