Search results for "Crete"
showing 10 items of 2495 documents
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?
2012
It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Omega(log n / loglog n), and we exhibit quantum algorithms for two functions where this bound is achieved.
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
On the effect of analog noise in discrete-time analog computations
1998
We introduce a model for analog computation with discrete time in the presence of analog noise that is flexible enough to cover the most important concrete cases, such as noisy analog neural nets and networks of spiking neurons. This model subsumes the classical model for digital computation in the presence of noise. We show that the presence of arbitrarily small amounts of analog noise reduces the power of analog computational models to that of finite automata, and we also prove a new type of upper bound for the VC-dimension of computational models with analog noise.
Perceptual adaptive insensitivity for support vector machine image coding.
2005
Support vector machine (SVM) learning has been recently proposed for image compression in the frequency domain using a constant epsilon-insensitivity zone by Robinson and Kecman. However, according to the statistical properties of natural images and the properties of human perception, a constant insensitivity makes sense in the spatial domain but it is certainly not a good option in a frequency domain. In fact, in their approach, they made a fixed low-pass assumption as the number of discrete cosine transform (DCT) coefficients to be used in the training was limited. This paper extends the work of Robinson and Kecman by proposing the use of adaptive insensitivity SVMs [2] for image coding u…
The absolute center of a unicyclic network
1989
Abstract A unicyclic network is one generalization of a tree network. In this paper we examine the problem of finding an absolute center of a unicyclic network. We show that this problem can be solved in linear time with respect to the number of vertices in the network.
Two Parallel Algorithms for the Analysis of Random Images
1988
Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.
Ownership protection of plenoptic images by robust and reversible watermarking
2018
Abstract Plenoptic images are highly demanded for 3D representation of broad scenes. Contrary to the images captured by conventional cameras, plenoptic images carry a considerable amount of angular information, which is very appealing for 3D reconstruction and display of the scene. Plenoptic images are gaining increasing importance in areas like medical imaging, manufacturing control, metrology, or even entertainment business. Thus, the adaptation and refinement of watermarking techniques to plenoptic images is a matter of raising interest. In this paper a new method for plenoptic image watermarking is proposed. A secret key is used to specify the location of logo insertion. Employing discr…
Some subgroup embeddings in finite groups: A mini review
2015
[EN] In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied. ª 2014 Production and hosting by Elsevier B.V. on behalf of Cairo University
Application of Model Predictive Control in Discrete Displacement Cylinders to Drive a Knuckle Boom Crane
2018
In this paper, two Discrete Displacement Cylinders (DDCs) are used to drive the boom of a knuckle boom crane. DDCs operate by connecting one of several available pressure levels to each chamber in order to produce different forces. A trade-off exists with such systems, between the accuracy of tracking and energy dissipation due to switching. A popular way to approach this problem is a Force Shifting Algorithm (FSA). However, in this paper, the trade-off is managed by use of a Model Predictive Control (MPC) algorithm. The tracking accuracy and energy efficiency of the MPC and FSA strategies for DDCs are compared to a PID strategy for standard cylinders. The comparison is obtained by use of a…
Vertical scratches detection based on edge detection for old film
2010
Automatic detection of image damaged regions is the key to automatic video image inpainting. Vertical scratches are the common damages in the old film. In this paper, a vertical scratches detection algorithm based on edge detection is proposed. The proposed algorithm first uses the operator which has the largest response to the vertical edge in Sobel operator to detect edges, and then uses canny operator to detect edges further. Third, we detect vertical lines in the image through probabilistic Hough transform. Finally, we obtain the true locations of the vertical lines scratches through morphology and width constraints. Many experiments show that our method can detect vertical line scratch…