منابع مشابه
Stereo correspondence matching: Balanced multiwavelets versus unbalanced multiwavelets
This paper investigates the efficiency of unbalanced versus balanced multiwavelets in stereo correspondence matching. A multiwavelet transform is first applied to a pair of stereo images to decorrelate them into a number of subbands. Information in the approximation subbands of an unbalanced multiwavelet carries different spectral content of the input image while the balanced multiwavelet appro...
متن کاملA balanced perspective on unbalanced growth and thymineless death
The early history of the esoteric phenomenon of thymineless death (TLD) is recounted, from the pioneering discovery by Seymour Cohen and Hazel Barner, through my graduate studies at Yale and postdoctoral research in Copenhagen. My principal contribution was the discovery that restricted synthesis of protein and RNA permits cultures of Escherichia coli to complete their DNA replication cycles wi...
متن کاملBalanced and Unbalanced Single Wire
Reactive power in balanced and unbalanced lines constitutes the main problem that is examined in this article. We will describe a balanced line as a line with differential input and output signals. Unbalanced lines, such as the SWER scheme, have to cope with the reactive power problem. However, this problem does not exist in the one wire balanced B-Line scheme. In addition, various methods of g...
متن کاملOn Balanced vs. Unbalanced Computation Trees
A great number of complexity classes between P and PSPACE can be deened via leaf languages for computation trees of nondeterministic polynomial time machines. Jenner, McKenzie, and Th erien (Proceedings of the 9th Conference on Structure in Complexity Theory, 1994) raised the issue of whether considering balanced or unbalanced trees makes any diierence. For a number of leaf language classes, co...
متن کاملPiercing Numbers for Balanced and Unbalanced Families
Given a finite family F of convex sets in R, we say that F has the (p, q)r property if for any p convex sets in F there are at least r q-tuples that have non empty intersection. The piercing number of F is the minimum number of points we need to intersect all the sets in F . In this paper we willl find some bounds for the piercing number of families of convex sets with (p, q)r properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intereconomics
سال: 1975
ISSN: 0020-5346,1613-964X
DOI: 10.1007/bf02929572