Sciweavers

1732 search results - page 3 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
ARSCOM
2004
72views more  ARSCOM 2004»
14 years 9 months ago
Exponential lower bounds for the numbers of Skolem-type sequences
It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 ...
G. K. Bennett, Mike J. Grannell, Terry S. Griggs
PAMI
2007
157views more  PAMI 2007»
14 years 9 months ago
Pores and Ridges: High-Resolution Fingerprint Matching Using Level 3 Features
—Fingerprint friction ridge details are generally described in a hierarchical order at three different levels, namely, Level 1 (pattern), Level 2 (minutia points), and Level 3 (p...
Anil K. Jain, Yi Chen, Meltem Demirkus
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 6 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 3 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
15 years 1 months ago
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
Richard Chang, Jim Kadin