نتایج جستجو برای: dual hyper k

تعداد نتایج: 549891  

2013
T. Akiri A. Himmel K. Scholberg C. W. Walter

We propose the Hyper-Kamiokande (Hyper-K) detector as a next generation underground water Cherenkov detector [1]. It will serve as a far detector of a long baseline neutrino oscillation experiment envisioned for the upgraded J-PARC beam, and as a detector capable of observing, far beyond the sensitivity of the Super-Kamiokande (Super-K) detector, proton decays, atmospheric neutrinos, and neutri...

Journal: :iranian journal of mathematical chemistry 2015
a. parvan-moldovan m. v. diudea

hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

Journal: :Journal of High Energy Physics 2022

Supersymmetric Sp(k) quantum chromodynamics with 8 supercharges in space-time dimensions 3 to 6 can be realised by two different Type II brane configurations the presence of orientifolds. Consequently, types magnetic quivers describe Higgs branch SQCD theory. This is a salient example general phenomenon: given hyper-Kahler may admit several quiver constructions. It then natural wonder if these ...

2010
Justyna Petke Peter Jeavons

Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Bool...

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

2005
Tomás Skopal Jaroslav Pokorný Václav Snásel

We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-...

Journal: :Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics 2021

Journal: :Revista Matemática Contemporânea 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید