Loading...
Search for:
arithmetization
0.015 seconds
Total 65 records
A novel context modeling scheme for motion vectors context-based arithmetic coding
, Article Canadian Conference on Electrical and Computer Engineering; Technology Driving Innovation, 2004, Niagara Falls, 2 May 2004 through 5 May 2004 ; Volume 4 , 2004 , Pages 2021-2024 ; 08407789 (ISSN); 0780382536 (ISBN) ; Ghandi, M. M ; Shamsollahi, M. B ; Sharif University of Technology
2004
Abstract
In this paper a new context modelling scheme for arithmetic coding of Motion Vectors (MVs) is proposed. The model uses the correlation between the horizontal and vertical components of MVs to improve the probability estimation of symbols. The accurate probability estimation can therefore improve the efficiency of the context-based arithmetic coder. The proposed scheme has been adapted to the H.264 advanced video codec and the simulation results show that a considerable bit rate saving can be achieved in MV coding
Intuitionistic axiomatizations for bounded extension Kripke models
, Article Annals of Pure and Applied Logic ; Volume 124, Issue 1-3 , 2003 , Pages 267-285 ; 01680072 (ISSN) ; Ruitenburg, W ; Salehi, S ; Sharif University of Technology
2003
Abstract
We present axiom systems, and provide soundness and strong completeness theorems, for classes of Kripke models with restricted extension rules among the node structures of the model. As examples we present an axiom system for the class of cofinal extension Kripke models, and an axiom system for the class of end-extension Kripke models. We also show that Heyting arithmetic (HA) is strongly complete for its class of end-extension models. Cofinal extension models of HA are models of Peano arithmetic (PA). © 2003 Elsevier B.V. All rights reserved
Every rooted narrow tree Kripke model of HA is locally PA
, Article Mathematical Logic Quarterly ; Volume 48, Issue 3 , 2002 , Pages 391-395 ; 09425616 (ISSN) ; Hesaam, B ; Sharif University of Technology
2002
Abstract
We prove that every infinite rooted narrow tree Kripke model of HA is locally PA
Higher-Order quantified boolean satisfiability
, Article 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 22 August 2022 through 26 August 2022 ; Volume 241 , 2022 ; 18688969 (ISSN); 9783959772563 (ISBN) ; Haase, C ; Hadizadeh, Z ; Mansutti, A ; Sharif University of Technology
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
2022
Abstract
The Boolean satisfiability problem plays a central role in computational complexity and is often used as a starting point for showing NP lower bounds. Generalisations such as Succinct SAT, where a Boolean formula is succinctly represented as a Boolean circuit, have been studied in the literature in order to lift the Boolean satisfiability problem to higher complexity classes such as NEXP. While, in theory, iterating this approach yields complete problems for k-NEXP for all k > 0, using such iterations of Succinct SAT is at best tedious when it comes to proving lower bounds. The main contribution of this paper is to show that the Boolean satisfiability problem has another canonical...
Distributed Verifiable Computing: Algorithms and Analysis
, M.Sc. Thesis Sharif University of Technology ; Maddah Ali, Mohammad Ali (Supervisor)
Abstract
Zero knowledge proofs allow a person (prover) to convince another person (verifier) that he has performed a specific computation on a secret data correctly, and has obtained a true answer, without having to disclose the secret data. QAP (Quadratic Arithmetic Program) based zkSNARKs (zero knowledge Succinct Non-interactive Argument of Knowledge) are a type of zero knowledge proof. They have several properties that make them attractive in practice, e.g. verifier's work is very easy. So they are used in many areas such as Blockchain and cloud computing. But yet prover's work in QAP based zkSNARKs is heavy, therefore, it may not be possible for a prover with limited processing resource to run...