Sciweavers

1379 search results - page 37 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
ISBI
2002
IEEE
15 years 10 months ago
Towards high performance small animal positron emission tomography
During the last decade increasingly sophisticated positron emission tomography (PET) scanners have been developed for imaging small laboratory animals. These systems often exhibit...
Calvin A. Johnson, Jürgen Seidel, Javier Pasc...
COMPGEOM
2003
ACM
15 years 3 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
ICIP
2001
IEEE
15 years 11 months ago
Face detection from cluttered images using a polynomial neural network
In this paper, we propose a new method for face detection from cluttered images. We use a polynomial neural network (PNN) for separation of face and non-face patterns while the co...
Lin-Lin Huang, Akinobu Shimizu, Yoshihiro Hagihara...
CORR
2007
Springer
74views Education» more  CORR 2007»
14 years 10 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
ICML
1999
IEEE
15 years 10 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar