Sciweavers

10608 search results - page 92 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICPR
2008
IEEE
14 years 4 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
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
14 years 2 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»
14 years 2 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»
14 years 2 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
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
14 years 1 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...