نتایج جستجو برای: ground complexity
تعداد نتایج: 456669 فیلتر نتایج به سال:
The ground term reachability problem consists in determining whether a given variable-free term t can be transformed into a given variable-free term t′ by the application of rules from a term rewriting system R. The joinability problem, on the other hand, consists in determining whether there exists a variable-free term t′′ which is reachable both from t and from t′. Both problems have proven t...
We introduce a large-scale RGBD hand segmentation dataset, with detailed and automatically generated highquality ground-truth annotations. Existing real-world datasets are limited in quantity due to the difficulty in manually annotating ground-truth labels. By leveraging a pair of brightly colored gloves and an RGBD camera, we propose an acquisition pipeline that eases the task of annotating ve...
This work deals with the task of melody extraction from symphonic music recordings, where the term ‘melody’ is understood as ‘the single (monophonic) pitch sequence that a listener might reproduce if asked to whistle or hum a piece of polyphonic music and that a listener would recognise as being the “essence” of that music when heard in comparison’. Melody extraction algorithms are commonly eva...
The generation of gauge–dependent fermion vacuum condensates in Yang– Mills theory would dynamically break the gauge symmetry and thus provide an alternative to the Higgs mechanism in unified theories. We explore a simple example: instanton-induced quark pair (diquark) condensation in QCD with 2 flavors and Nc colors. We do find diquark condensates in the vacuum, but only for Nc = 2, where they...
Optimization Algorithms Based on Renormalization Group Application to 2D Edwards-Anderson Spin Glass
Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation. Emphasis is on the relationship between the structure of low-energy excitations and “block-spins” appearing in the algorithms. We also discuss the implication of existence of a finite...
A convincing, uncontroversial observation of string breaking, when the static potential is extracted from Wilson loops only, is still missing. This failure can be understood if the overlap of the Wilson loop with the broken string is exponentially small. In that case, the broken string ground state will only be seen if the Wilson loop is long enough. Our preliminary results show string breaking...
Na radioactively decays to an excited state of Ne either by emission of a positron (90% probability) or by electron capture (10% probability). The excited Ne nucleus decays with a mean life 3×10−12 s to the ground state with the emission of a 1.274 MeV gamma. The positrons are emitted with a range of kinetic energies up to about 0.5 MeV. They lose this energy quickly (10−9 s) in the material !"...
We present a unified framework on the limits of constraint satisfaction problems (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut decomposition without recourse to the weakly regular partitions. In particular, we formulate and prove a representation theorem for compact colored r-uniform directed hypergraph (r-graph) limits, and apply this ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید