Filters








95,135 Hits in 6.0 sec

P-rho-Log: Combining Logic Programming with Conditional Transformation Systems

Besik Dundua, Temur Kutsia, Klaus Reisenberger-Hagmayer, Marc Herbstritt
2016 International Conference on Logic Programming  
PρLog extends Prolog by conditional transformations that are controlled by strategies. We give a brief overview of the tool and illustrate its capabilities.  ...  Here we briefly describe the current status of PρLog. A more detailed overview can be found in [10] .  ...  10:2 PρLog (Tool Description) them, first of all, by its pattern matching capabilities.  ... 
doi:10.4230/oasics.iclp.2016.10 dblp:conf/iclp/DunduaKR16 fatcat:nxmcrrnstnafhlpemhwwyufdo4

On some metric topologies on Privalov spaces on the unit disk [article]

Romeo Meštrović, Žarko Pavićević
2018 arXiv   pre-print
Let $N^p$ $(11$, we consider the class $N^p$ as the space $M^p$ equipped with the topology induced by the metric $\rho_p$ defined as $$ \rho_p(f,g) = \Bigg(\int_0^{2\pi}\log^p(1+M(f-g)(\theta))\, \frac  ...  The space $N^p$ with the associated modular in the sense of Musielak and Orlicz becomes the Hardy-Orlicz class.  ...  This work was supported by the MEPhI Academic Excellence Project (agreement with the Ministry of Education and Science of the Russian Federation of August 27, 2013, project no. 02.a03.21.0005).  ... 
arXiv:1811.08956v1 fatcat:4pyol6oquvayzapc2l3nqceffi

LORD: LOw-complexity, Rate-controlled, Distributed Video Coding System

R. Cohen, D. Malah
2012 2012 Eighth International Conference on Signal Image Technology and Internet Based Systems  
1 2 log 2 σ 2 i σ 2 + 1 2 log 2 h i H + 1 2 log 2 m i M b = B P , σ 2 = P i=1 σ 2 i 1/P , H = P i=1 h i 1/P , M = P i=1 m i 1/P R (ρ) = θ (1 − ρ) θ is a constant related to the image content The number  ...  of zeros is controlled by the parameter q used in JPEG The noise (N) betweenX 2k−2 andX 2k−1 serves as an estimate of the noise between the SI (Y ) and the WZ frame (X ) N is assumed to be Laplace-distributed  ... 
doi:10.1109/sitis.2012.14 dblp:conf/sitis/CohenM12 fatcat:ibznukm6wbbcbbap27dub2x5j4

On summatory functions of additive functions and regular variation [article]

Aleksandar Ivić
2003 arXiv   pre-print
An overview of results and problems concerning the asymptotic behaviour for summatory functions of a certain class of additive functions is given.  ...  The class of functions in question involves Karamata's regular variation. Some new Abelian and Tauberian results for additive functions of the form F(n) = ∑_p^α||nα h(p) are given.  ...  Introduction The purpose of this paper is to provide an overview of results and problems concerning the asymptotic behaviour of summatory functions for a certain class of additive functions.  ... 
arXiv:math/0311345v1 fatcat:ljdhrpswabfjrpfkvdvi4fwy3m

Association mapping via a class of haplotype-sharing statistics

Andrew S Allen, Glen A Satten
2007 BMC Proceedings  
We give an overview of this framework and apply four such tests to the simulated data of Genetic Analysis Workshop 15.  ...  We present a class of haplotype-sharing statistics useful for association mapping in case-parent trio data.  ...  Here, we give an overview of these results and apply them to the Genetic Analysis Workshop 15 (GAW15) Problem 3 data.  ... 
doi:10.1186/1753-6561-1-s1-s123 pmid:18466465 pmcid:PMC2367563 fatcat:swaowco4dnaifhzdmwy6o2uhnq

Cutoff Phenomenon and Limiting Profile of a Random Walk on the Symmetric Group [article]

Ahmed Farah
2021 arXiv   pre-print
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups.  ...  Evita Nestoridi, for introducing me to card shuffles and the work of Prof. Persi Diaconis on the representation theory of the symmetric group and for her guidance throughout this project.  ...  Section 3 gives an overview of Diaconis and Shahshahani's upper bound on the variation distance in (4). Section 4 gives an overview of some of the techniques used in Teyssier's proof in (5).  ... 
arXiv:2112.04655v1 fatcat:bbouawwe35fcbbm4563idkrruu

Information utility in active sequential hypothesis testing

Mohammad Naghshvar, Tara Javidi
2010 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In this paper, using a dynamic programming interpretation, an optimal notion of information utility is derived.  ...  In all of these applications, a decision maker is responsible to control the system dynamically so as to enhance his information in a speedy manner about an underlying phenomena of interest while accounting  ...  Finally, we present an overview of the results in [5] regarding the DP solution and also the sufficient condition for reduction to passive testing. A.  ... 
doi:10.1109/allerton.2010.5706897 fatcat:zuu7rcwmz5cmxjix6j3yod7daa

Strategies in PRholog

Besik Dundua, Temur Kutsia, Mircea Marin
2010 Electronic Proceedings in Theoretical Computer Science  
We give an overview on programming with strategies in PRholog and demonstrate how rewriting strategies can be expressed.  ...  PRholog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with Rholog calculus.  ...  The user can also program different traversal strategies pretty easily inside PρLog. The goal of this paper is to give an overview of PρLog and, in particular, show how it uses strategies.  ... 
doi:10.4204/eptcs.15.3 fatcat:oeqh7gnoybaxrb7ol34j7lnhfe

Sequentiality and Adaptivity Gains in Active Hypothesis Testing

Mohammad Naghshvar, Tara Javidi
2013 IEEE Journal on Selected Topics in Signal Processing  
Consider a decision maker who is responsible to collect observations so as to enhance his information in a speedy manner about an underlying phenomena of interest.  ...  Using these bounds, sequentiality gain and adaptivity gain, i.e., the gains of sequential and adaptive selection of actions are characterized.  ...  Here we provide an overview.  ... 
doi:10.1109/jstsp.2013.2261279 fatcat:e3z2ovhyp5aczbakzrttxh4nqy

The Correct Exponent for the Gotsman-Linial Conjecture [article]

Daniel M. Kane
2012 arXiv   pre-print
We prove a new bound on the average sensitivity of polynomial threshold functions.  ...  In particular we show that a polynomial threshold function of degree d in at most n variables has average sensitivity at most √(n)((n))^O(d(d))2^O(d^2(d).  ...  Acknowledgements This work was done with the support of an NSF postdoctoral fellowship.  ... 
arXiv:1210.1283v1 fatcat:mu4jjd4rqzff3bsvb7kxgfsrzi

Supporting Flexible Processes through Recommendations Based on History [chapter]

Helen Schonenberg, Barbara Weber, Boudewijn van Dongen, Wil van der Aalst
2008 Lecture Notes in Computer Science  
In this paper we also evaluate the proposed recommendation service, by means of experiments.  ...  To allow for flexible systems with a high degree of support, intelligent user assistance is required.  ...  We define ω(ρ, σ),i.e., the relative importance of a log trace σ when considering the partial trace ρ as follows: ωp(ρ, σ) = 1 , if ρp ≤ σp 0 , otherwise , ωs (ρ, σ) = |ρs ∩ σs | |ρs | , ωm (ρ, σ) = |ρm  ... 
doi:10.1007/978-3-540-85758-7_7 fatcat:j7dptmkynva2bccfuaiqxnayrq

Speculative growth, overreaction, and the welfare cost of technology-driven bubbles

Kevin J. Lansing
2012 Journal of Economic Behavior and Organization  
) λ B i φ Rational Law of Motion: Overreaction Behavior Tends to be Self-Con…rming w t = e w exp (m z t ) , z t = ρz t 1 + ε t , e w exp [E (log w t )] , Rational Forecast: E t w t +1 = e w exp mρ z t  ...  5.42 7.80 ∆ log (p t ) 1872-2008 17.9 6.24 12.2 Note: Overview Historical Motivation Related Literature Model Calibration Results Conclusion Asset Pricing Moments: Model versus Data  ...  [O]bviously the last decade has shown that bursting bubbles can be an extraordinarily dangerous and costly phenomenon for the economy and there is no doubt that as we emerge from the …nancial crisis, we  ... 
doi:10.1016/j.jebo.2012.02.011 fatcat:6pb3k4d3gjdz5feoubfzy2ityy

Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams

Michael Elkin, Chhaya Trehan
2022 Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing  
(In fact, existing solutions also incur an extra factor of 1 +ϵ in the stretch for weighted graphs, and an additional factor of log O (1) n in the space.)  ...  Solutions of the first type are doomed to incur a stretch-space tradeoff of 2κ − 1 versus n 1+1/κ , for an integer parameter κ.  ...  using O (n 1+ρ log 4 n) space whp, where β is given by: β = log κρ + 1/ρ ϵ log κ ρ+1/ρ .  ... 
doi:10.1145/3519270.3538469 fatcat:ahuglaqxd5ek5jskngvyklnl3a

PIE-Net: Photometric Invariant Edge Guided Network for Intrinsic Image Decomposition [article]

Partha Das, Sezer Karaoglu, Theo Gevers
2022 arXiv   pre-print
Intrinsic image decomposition is the process of recovering the image formation components (reflectance and shading) from an image.  ...  An extensive ablation study and large scale experiments are conducted showing that it is beneficial for edge-driven hybrid IID networks to make use of illumination invariant descriptors and that separating  ...  Fig. 1 provides an overview of the proposed network.  ... 
arXiv:2203.16670v2 fatcat:4lc7li44qfhw7bfjnaj2s4gl3q

An overview of the balanced excited random walk [article]

Daniel Camarena, Gonzalo Panizo, Alejandro F. Ramírez
2020 arXiv   pre-print
Here we give an overview of this model when d_1+d_2=d and introduce and study the cases when d_1+d_2>d.  ...  Alejandro Ramírez thanks the support of Iniciativa Científica Milenio and of Fondo Nacional de Desarrollo Científico y Tecnológico grant 1180259  ...  Acknowledgements Daniel Camarena and Gonzalo Panizo thank the support of Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica CG-176-2015.  ... 
arXiv:2002.05750v2 fatcat:wpqnqydw65benkztvcsepqqvy4
« Previous Showing results 1 — 15 out of 95,135 results