Einloggen

Thematische Bibliographien / Polylgot / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Polylgot“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Polylgot.

Autor: Grafiati

Veröffentlicht am 25. Juli 2024

Zuletzt aktualisiert am 31. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Polylgot" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Agarwal, Dinesh K. „Agarwal PolyLoop Ligation Technique for the Management of the Distal Ureter during Laparoscopic Assisted Nephroureterectomy“. Current Urology 13, Nr. 4 (2019): 209–13. http://dx.doi.org/10.1159/000499270.

Der volle Inhalt der Quelle

Annotation:

Objective: Management of the distal ureter during radical nephroureterectomy remains a controversial issue. This article describes a simple endoscopic PolyLoop ligation technique for managing the distal ureter during radical nephroureterectomy. Technique: This endoscopic technique was used in 6 cases to manage the distal ureter during laparoscopic-assisted radical nephroureterectomy. The distal ureter with en bloc bladder cuff was managed endoscopically. The distal ureteric orifice with 1 cm bladder cuff was circumscribed using a Collins knife. Commercially available, Olympus detachable PolyLoop was used to ligate the ureteric stump to avoid urine spillage from the upper tract. Once ureteric stump was ligated with a PolyLoop, the distal ureter was mobilized by dividing the periureteric adhesions using a Collins knife. Results: Distal ureter was managed successfully in all 6 cases using commercially available detachable Polyloop from Olympus. There were no perioperative complications relating to this technique. Conclusion: The PolyLoop ligation technique offers a simple and safer alternative to manage the distal ureter during radical nephroureterectomy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Howard Lee, M., und Jangil Kim. „Quantum gases and polylogs“. Physica A: Statistical Mechanics and its Applications 304, Nr. 3-4 (Februar 2002): 421–28. http://dx.doi.org/10.1016/s0378-4371(01)00552-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Dietze, Gabriele. „Den ›anderen‹ Polylog wahrnehmen“. Zeitschrift für Kulturwissenschaft 5, Nr. 2 (Dezember 2011): 157–60. http://dx.doi.org/10.14361/zfk.2011.0219.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Jeltsch-Schudel, Barbara, Erica Brühlmann-Jecklin, Christina Fasser, Urs Kaiser und Barbara Wenk. „Polylog: Behindert sein - älter werden“. Vierteljahresschrift für Heilpädagogik und ihre Nachbargebiete 80, Nr. 2 (2011): 154–60. http://dx.doi.org/10.2378/vhn2011.art11d.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Vogt, Nina. „Lineage tracing with Polylox barcodes“. Nature Methods 14, Nr. 10 (29.09.2017): 940. http://dx.doi.org/10.1038/nmeth.4451.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Jo, Hae-jeong. „Buddhism and Intercultural philosophy : Emptiness(Śūnyatā) and Polylogue(Polylog)“. Journal of Eastern-Asia Buddhism and Culture 29 (31.03.2017): 527–56. http://dx.doi.org/10.21718/eabc.2017.29.18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Ahn, Kook Jin, Graham Cormode, Sudipto Guha, Andrew McGregor und Anthony Wirth. „Correlation Clustering in Data Streams“. Algorithmica 83, Nr. 7 (13.03.2021): 1980–2017. http://dx.doi.org/10.1007/s00453-021-00816-9.

Der volle Inhalt der Quelle

Annotation:

AbstractClustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as k-center, k-median, and k-means. Such algorithms need to be both time and and space efficient. In this paper, we address the problem of correlation clustering in the dynamic data stream model. The stream consists of updates to the edge weights of a graph on n nodes and the goal is to find a node-partition such that the end-points of negative-weight edges are typically in different clusters whereas the end-points of positive-weight edges are typically in the same cluster. We present polynomial-time, $$O(n\cdot {{\,\mathrm{polylog}\,}}n)$$ O ( n · polylog n ) -space approximation algorithms for natural problems that arise. We first develop data structures based on linear sketches that allow the “quality” of a given node-partition to be measured. We then combine these data structures with convex programming and sampling techniques to solve the relevant approximation problem. Unfortunately, the standard LP and SDP formulations are not obviously solvable in $$O(n\cdot {{\,\mathrm{polylog}\,}}n)$$ O ( n · polylog n ) -space. Our work presents space-efficient algorithms for the convex programming required, as well as approaches to reduce the adaptivity of the sampling.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Samiullah, Sami, Hadi Bhurgri, Razvi Razack und Sushil Ahlawat. „Salvaging a sticky situation: a stuck PolyLoop“. Gastrointestinal Endoscopy 79, Nr. 4 (April 2014): 695–96. http://dx.doi.org/10.1016/j.gie.2013.10.041.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Ben-Sasson, Eli, und Madhu Sudan. „Short PCPs with Polylog Query Complexity“. SIAM Journal on Computing 38, Nr. 2 (Januar 2008): 551–607. http://dx.doi.org/10.1137/050646445.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Ferrara, Margaret M. „Capturing Conversations of Change: The Polylog“. Action in Teacher Education 22, sup2 (August 2000): 55–64. http://dx.doi.org/10.1080/01626620.2000.10463039.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Mező, István. „A family of polylog-trigonometric integrals“. Ramanujan Journal 46, Nr. 1 (24.07.2017): 161–71. http://dx.doi.org/10.1007/s11139-017-9917-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Ballard, Jennifer Snell, und Jerry Lee. „Recognition of Maximal Lift Capacity using the Polylift“. Advances in Science, Technology and Engineering Systems Journal 6, Nr. 1 (Januar 2021): 121–27. http://dx.doi.org/10.25046/aj060113.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Kaura, Tarun, und Sahibzada Usman Latif. „Polyloop anchor technique to close large gastric fistula“. VideoGIE 3, Nr. 12 (Dezember 2018): 392–94. http://dx.doi.org/10.1016/j.vgie.2018.08.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Grünberg, Daniel B. „On Asymptotics, Stirling Numbers, Gamma Function and Polylogs“. Results in Mathematics 49, Nr. 1-2 (November 2006): 89–125. http://dx.doi.org/10.1007/s00025-006-0211-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Lin, Ming, Shuang Qiu, Jieping Ye, Xiaomin Song, Qi Qian, Liang Sun, Shenghuo Zhu und Rong Jin. „Which Factorization Machine Modeling Is Better: A Theoretical Answer with Optimal Guarantee“. Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 4312–19. http://dx.doi.org/10.1609/aaai.v33i01.33014312.

Der volle Inhalt der Quelle

Annotation:

Factorization machine (FM) is a popular machine learning model to capture the second order feature interactions. The optimal learning guarantee of FM and its generalized version is not yet developed. For a rank k generalized FM of d dimensional input, the previous best known sampling complexity is O[k3d · polylog(kd)] under Gaussian distribution. This bound is sub-optimal comparing to the information theoretical lower bound O(kd). In this work, we aim to tighten this bound towards optimal and generalize the analysis to sub-gaussian distribution. We prove that when the input data satisfies the so-called τ-Moment Invertible Property, the sampling complexity of generalized FM can be improved to O[k2d · polylog(kd)/τ2]. When the second order self-interaction terms are excluded in the generalized FM, the bound can be improved to the optimal O[kd · polylog(kd)] up to the logarithmic factors. Our analysis also suggests that the positive semi-definite constraint in the conventional FM is redundant as it does not improve the sampling complexity while making the model difficult to optimize. We evaluate our improved FM model in real-time high precision GPS signal calibration task to validate its superiority.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Sofo, Anthony. „Some BBP-type series for polylog integrals“. Acta et Commentationes Universitatis Tartuensis de Mathematica 25, Nr. 2 (17.11.2021): 315–29. http://dx.doi.org/10.12697/acutm.2021.25.21.

Der volle Inhalt der Quelle

Annotation:

An investigation into a family of definite integrals containing log-polylog functions will be undertaken in this paper. It will be shown that Euler sums play an important part in the solution of these integrals and may be represented as a BBP-type formula. In a special case we prove that the corresponding log integral can be represented as a linear combination of the product of zeta functions and the Dirichlet beta function.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Bradford, Phillip G., Gregory J. E. Rawlins und Gregory E. Shannon. „Efficient Matrix Chain Ordering in Polylog Time“. SIAM Journal on Computing 27, Nr. 2 (April 1998): 466–90. http://dx.doi.org/10.1137/s0097539794270698.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Ragde, Prabhakar, und Avi Wigderson. „Linear-size constant-depth polylog-threshold circuits“. Information Processing Letters 39, Nr. 3 (August 1991): 143–46. http://dx.doi.org/10.1016/0020-0190(91)90110-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Moser, Philippe. „Polylog depth, highness and lowness for E“. Information and Computation 271 (April 2020): 104483. http://dx.doi.org/10.1016/j.ic.2019.104483.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Mahasinghe, Anuradha. „Vibration Analysis of Cyclic Symmetrical Systems by Quantum Algorithms“. Mathematical Problems in Engineering 2019 (11.06.2019): 1–10. http://dx.doi.org/10.1155/2019/4969351.

Der volle Inhalt der Quelle

Annotation:

Quantum computers have provided exponentially faster solutions to several physical and engineering problems over existing classical solutions. In this paper we present two quantum algorithms to analyze the forced vibration of a mechanical system with cyclic symmetry. Our main algorithm solves the equation of motion of an undamped and nonelastic rotating system with cyclic symmetry consisting of n sectors, by encoding the displacements of each sector at time t in a quantum state. The runtime of this algorithm is polylog in both n and t, thus exponentially faster than the analogous classical algorithm. Also we consider damped and elastic systems with cyclic symmetry and present another quantum algorithm to solve it in runtime polylog in n and polynomial in t.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

O’Donnell, Ryan, Rocco A. Servedio und Li-Yang Tan. „Fooling Polytopes“. Journal of the ACM 69, Nr. 2 (30.04.2022): 1–37. http://dx.doi.org/10.1145/3460532.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Manning, Frank E., Michael Bristol, Umberto Eco, V. V. Ivanov, Monica Rector und Alessandro Falassi. „Of Time and Mime: A Polylog on Festivity“. TDR (1988-) 33, Nr. 1 (1989): 19. http://dx.doi.org/10.2307/1145938.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Mező, I. „Log-sine-polylog integrals and alternating Euler sums“. Acta Mathematica Hungarica 160, Nr. 1 (05.09.2019): 45–57. http://dx.doi.org/10.1007/s10474-019-00975-w.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Pauls, Christina, Wolfgang Dörner, Katharina Huxol, Sylvia Lustig, Marius Thomay, Christoph Weller und Michaela Zöhrer. „Konfliktbearbeitung erforschen. Ein erfahrungsbasierter Polylog über Partizipative Konfliktforschung“. Konfliktdynamik 12, Nr. 3 (2023): 221–28. http://dx.doi.org/10.5771/2193-0147-2023-3-221.

Der volle Inhalt der Quelle

Annotation:

Bei der Erforschung von und in Konfliktkonstellationen ist es wichtig, gesellschaftliche (Macht-)Asymmetrien und Eskalationspotenziale im Blick zu haben und sensible wie kreative Umgangsformen mit ihnen zu finden. Dieser Beitrag bietet auf erfahrungsbasierter Grundlage eine Einschätzung dazu an, inwiefern sich Partizipative Konfliktforschung vor dem genannten Hintergrund als besonders geeignet für die Erforschung von Konfliktbearbeitung erweist. Er beruht auf Erfahrungen aus der Pilotphase des Projekts »Kommunale Konfliktberatung und Partizipative Konfliktforschung« (KomPa). Skizziert werden der Forschungskontext und zentrale Begriffe, bevor in einem polylogischen Gesprächsformat die Beteiligten des Forschungsprojektes in einen Austausch über ihre gewonnenen Einsichten und Erkenntnisse treten.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Jun, Wang. „The Openness of Life-world and the Intercultural Polylogue“. Yearbook for Eastern and Western Philosophy 2019, Nr. 4 (26.05.2020): 150–62. http://dx.doi.org/10.1515/yewph-2020-0013.

Der volle Inhalt der Quelle

Annotation:

AbstractThe phenomenological conception of “life-world” lays the theoretical foundation for the openness of the world. The founding relationship between the individual and the world, the interactive relationship among different cultural worlds on the intersubjective level, the free nature of truth and its presence in the open world, the “ek-sistent” characteristics of the human-being, the structural constitution of the life-world – all these topics demonstrate the open nature of the world in a phenomenological way. Based on these ideas, “reflective judgment” as “phronesis” and “fear” as ethic sentiment based on family experience become the practical stance, which is consistent with the “life-world” conception of phenomenology; the characteristics of publicness and intersubjectivity of the open world are thus maintained. In the face of the multicultural world, this attitude presents as a brand-new practice of intercultural philosophy, which is different from the centralism found under the framework of monism and the comparative philosophy under the framework of dualism. Such a practice of intercultural philosophy is “polylog”, i.e. based on the principles of difference and equality and searching for the “overlapping consensus” in full multi-participatory discussion. Through polylog, a harmonious life of human community is constructed. This paper attempts to derive a set of practical principles for maintaining the openness of the world and intercultural polylog in the era of globalization from the theoretical view of the phenomenological life-world.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

ZHAO, JIANQIANG. „MULTI-POLYLOGS AT TWELFTH ROOTS OF UNITY AND SPECIAL VALUES OF WITTEN MULTIPLE ZETA FUNCTION ATTACHED TO THE EXCEPTIONAL LIE ALGEBRA 𝔤2“. Journal of Algebra and Its Applications 09, Nr. 02 (April 2010): 327–37. http://dx.doi.org/10.1142/s021949881000394x.

Der volle Inhalt der Quelle

Annotation:

In this note, we shall study the Witten multiple zeta function associated with the exceptional Lie algebra 𝔤2. Our main result shows that its special values at nonnegative integers can always be expressed as rational linear combinations of the multi-polylogs evaluated at 12th roots of unity, except for two irregular cases.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Zhang, Zhicheng, Qisheng Wang und Mingsheng Ying. „Parallel Quantum Algorithm for Hamiltonian Simulation“. Quantum 8 (15.01.2024): 1228. http://dx.doi.org/10.22331/q-2024-01-15-1228.

Der volle Inhalt der Quelle

Annotation:

We study how parallelism can speed up quantum simulation. A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse structures, called uniform-structured Hamiltonians, including various Hamiltonians of practical interest like local Hamiltonians and Pauli sums. Given the oracle access to the target sparse Hamiltonian, in both query and gate complexity, the running time of our parallel quantum simulation algorithm measured by the quantum circuit depth has a doubly (poly-)logarithmic dependence polylog⁡log⁡(1/ϵ) on the simulation precision ϵ. This presents an exponential improvement over the dependence polylog⁡(1/ϵ) of previous optimal sparse Hamiltonian simulation algorithm without parallelism. To obtain this result, we introduce a novel notion of parallel quantum walk, based on Childs' quantum walk. The target evolution unitary is approximated by a truncated Taylor series, which is obtained by combining these quantum walks in a parallel way. A lower bound Ω(log⁡log⁡(1/ϵ)) is established, showing that the ϵ-dependence of the gate depth achieved in this work cannot be significantly improved.Our algorithm is applied to simulating three physical models: the Heisenberg model, the Sachdev-Ye-Kitaev model and a quantum chemistry model in second quantization. By explicitly calculating the gate complexity for implementing the oracles, we show that on all these models, the total gate depth of our algorithm has a polylog⁡log⁡(1/ϵ) dependence in the parallel setting.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Yamaguchi, Soichiro, und Motokichi Torii. „The Radiation Pattern of 4L-Polyloop Antenna with Finite Reflector.“ Journal of the Institute of Image Information and Television Engineers 52, Nr. 12 (1998): 1884–86. http://dx.doi.org/10.3169/itej.52.1884.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Kalai, Yael Tauman, Ran Raz und Ron D. Rothblum. „How to Delegate Computations: The Power of No-Signaling Proofs“. Journal of the ACM 69, Nr. 1 (28.02.2022): 1–82. http://dx.doi.org/10.1145/3456867.

Der volle Inhalt der Quelle

Annotation:

We construct a 1-round delegation scheme (i.e., argument-system) for every language computable in time t = t ( n ), where the running time of the prover is poly ( t ) and the running time of the verifier is n · polylog ( t ). In particular, for every language in P we obtain a delegation scheme with almost linear time verification. Our construction relies on the existence of a computational sub-exponentially secure private information retrieval ( PIR ) scheme. The proof exploits a curious connection between the problem of computation delegation and the model of multi-prover interactive proofs that are sound against no-signaling (cheating) strategies , a model that was studied in the context of multi-prover interactive proofs with provers that share quantum entanglement, and is motivated by the physical principle that information cannot travel faster than light. For any language computable in time t = t ( n ), we construct a multi-prover interactive proof ( MIP ), that is, sound against no-signaling strategies, where the running time of the provers is poly ( t ), the number of provers is polylog ( t ), and the running time of the verifier is n · polylog ( t ). In particular, this shows that the class of languages that have polynomial-time MIP s that are sound against no-signaling strategies, is exactly EXP . Previously, this class was only known to contain PSPACE . To convert our MIP into a 1-round delegation scheme, we use the method suggested by Aiello et al. (ICALP, 2000), which makes use of a PIR scheme. This method lacked a proof of security. We prove that this method is secure assuming the underlying MIP is secure against no-signaling provers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Kawahira, Tomoki. „A Proof of Simultaneous Linearization with a Polylog Estimate“. Bulletin of the Polish Academy of Sciences Mathematics 55, Nr. 1 (2007): 43–52. http://dx.doi.org/10.4064/ba55-1-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Glaßer, Christian. „Languages polylog-time reducible to dot-depth 1/2“. Journal of Computer and System Sciences 73, Nr. 1 (Februar 2007): 36–56. http://dx.doi.org/10.1016/j.jcss.2006.09.004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Bloch, Stephen. „Function-algebraic characterizations of log and polylog parallel time“. Computational Complexity 4, Nr. 2 (Juni 1994): 175–205. http://dx.doi.org/10.1007/bf01202288.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Gavaldà, Ricard. „A positive relativization of polynomial time versus polylog space“. Information Processing Letters 46, Nr. 3 (Juni 1993): 119–23. http://dx.doi.org/10.1016/0020-0190(93)90056-f.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Sorenson, J. „Polylog Depth Circuits for Integer Factoring and Discrete Logarithms“. Information and Computation 110, Nr. 1 (April 1994): 1–18. http://dx.doi.org/10.1006/inco.1994.1021.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Amir, Amihood, Ayelet Butman und Ely Porat. „On the relationship between histogram indexing and block-mass indexing“. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, Nr. 2016 (28.05.2014): 20130132. http://dx.doi.org/10.1098/rsta.2013.0132.

Der volle Inhalt der Quelle

Annotation:

Histogram indexing , also known as jumbled pattern indexing and permutation indexing is one of the important current open problems in pattern matching. It was introduced about 6 years ago and has seen active research since. Yet, to date there is no algorithm that can preprocess a text T in time o (| T | 2 /polylog| T |) and achieve histogram indexing, even over a binary alphabet, in time independent of the text length. The pattern matching version of this problem has a simple linear-time solution. Block-mass pattern matching problem is a recently introduced problem, motivated by issues in mass-spectrometry. It is also an example of a pattern matching problem that has an efficient, almost linear-time solution but whose indexing version is daunting. However, for fixed finite alphabets, there has been progress made. In this paper, a strong connection between the histogram indexing problem and the block-mass pattern indexing problem is shown. The reduction we show between the two problems is amazingly simple. Its value lies in recognizing the connection between these two apparently disparate problems, rather than the complexity of the reduction. In addition, we show that for both these problems, even over unbounded alphabets, there are algorithms that preprocess a text T in time o (| T | 2 /polylog| T |) and enable answering indexing queries in time polynomial in the query length. The contributions of this paper are twofold: (i) we introduce the idea of allowing a trade-off between the preprocessing time and query time of various indexing problems that have been stumbling blocks in the literature. (ii) We take the first step in introducing a class of indexing problems that, we believe, cannot be pre-processed in time o (| T | 2 /polylog| T |) and enable linear-time query processing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Le Gall, Francois, Shota Nakagawa und Harumichi Nishimura. „On QMA protocols with two short quantum proofs“. Quantum Information and Computation 12, Nr. 7&8 (Juli 2012): 589–600. http://dx.doi.org/10.26421/qic12.7-8-4.

Der volle Inhalt der Quelle

Annotation:

This paper gives a QMA (Quantum Merlin-Arthur) protocol for 3-SAT with two logarithmic-size quantum proofs (that are not entangled with each other) such that the gap between the completeness and the soundness is $\Omega(\frac{1}{n\polylog{n}})$. This improves the best completeness/soundness gaps known for NP-complete problems in this setting.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Roccati, G. Matteo. „Michael Schwarze, Generische Wahrheit – Höfischer Polylog im Werk Jean Froissarts“. Studi Francesi, Nr. 146 (XLIX | II) (01.11.2005): 389–90. http://dx.doi.org/10.4000/studifrancesi.34312.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Зубавіна, Ірина. „Polylog with a Screen or Life as a Menu Interface“. Artistic Culture. Topical Issues, Nr. 14 (13.12.2018): 15–19. http://dx.doi.org/10.31500/1992-5514.14.2018.150888.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Pei, Weike, Thorsten B. Feyerabend, Jens Rössler, Xi Wang, Daniel Postrach, Katrin Busch, Immanuel Rode et al. „Polylox barcoding reveals haematopoietic stem cell fates realized in vivo“. Nature 548, Nr. 7668 (16.08.2017): 456–60. http://dx.doi.org/10.1038/nature23653.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Ma, Yuanliang, Huiming Ji, Zhenggou Jin, Jian Wang, Xuerong Zheng, Rongsen Yuan, Haiqin Li und Suqin Zhao. „Hexagonal plate-shaped CuSe nanocrystals by polylol solution chemical synthesis“. Integrated Ferroelectrics 181, Nr. 1 (13.06.2017): 102–12. http://dx.doi.org/10.1080/10584587.2017.1352398.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Schöning, Udo. „Michael Schwarze,Generische Wahrheit–Höfischer Polylog im Werk Jean Froissarts“. Zeitschrift für romanische Philologie (ZrP) 122, Nr. 2 (April 2006): 317–20. http://dx.doi.org/10.1515/zrph.2006.317.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Van Hemelryck, Tania. „Generische Wahrheit: Höfischer Polylog im Werk Jean Froissarts. Michael Schwarze“. Speculum 81, Nr. 2 (April 2006): 598–99. http://dx.doi.org/10.1017/s0038713400003468.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Mayordomo, Elvira, Philippe Moser und Sylvain Perifel. „Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable“. Theory of Computing Systems 48, Nr. 4 (14.05.2010): 731–66. http://dx.doi.org/10.1007/s00224-010-9267-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

FERBER, ASAF, KYLE LUH, DANIEL MONTEALEGRE und OANH NGUYEN. „Packing Loose Hamilton Cycles“. Combinatorics, Probability and Computing 26, Nr. 6 (01.08.2017): 839–49. http://dx.doi.org/10.1017/s0963548317000402.

Der volle Inhalt der Quelle

Annotation:

A subsetCof edges in ak-uniform hypergraphHis aloose Hamilton cycleifCcovers all the vertices ofHand there exists a cyclic ordering of these vertices such that the edges inCare segments of that order and such that every two consecutive edges share exactly one vertex. The binomial randomk-uniform hypergraphHkn,phas vertex set [n] and an edge setEobtained by adding eachk-tuplee∈ ($\binom{[n]}{k}$) toEwith probabilityp, independently at random.Here we consider the problem of finding edge-disjoint loose Hamilton cycles covering all buto(|E|) edges, referred to as thepacking problem. While it is known that the threshold probability of the appearance of a loose Hamilton cycle inHkn,pis$p=\Theta\biggl(\frac{\log n}{n^{k-1}}\biggr),$the best known bounds for the packing problem are aroundp= polylog(n)/n. Here we make substantial progress and prove the following asymptotically (up to a polylog(n) factor) best possible result: forp≥ logCn/nk−1, a randomk-uniform hypergraphHkn,pwith high probability contains$N:=(1-o(1))\frac{\binom{n}{k}p}{n/(k-1)}$edge-disjoint loose Hamilton cycles.Our proof utilizes and modifies the idea of ‘online sprinkling’ recently introduced by Vu and the first author.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Bodrunov, S. D. „Noosociety: an Integral Homogeneous Society Based on Noovalues, Polylogy and Post-State“. Noonomy and Noosociety. Almanac of Scientific Works of the S.Y. Witte INID 1, Nr. 2 (2022): 119–21. http://dx.doi.org/10.37930/2782-6465-2022-1-2-119-121.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Guan, X.-W., und M. T. Batchelor. „Polylogs, thermodynamics and scaling functions of one-dimensional quantum many-body systems“. Journal of Physics A: Mathematical and Theoretical 44, Nr. 10 (16.02.2011): 102001. http://dx.doi.org/10.1088/1751-8113/44/10/102001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Shlienkova, Elena V., und Khristina V. Kaygorodova. „From museum to postmuseum. Immersive environment as a metaspace of a polyloge“. Urban construction and architecture 14, Nr. 1 (25.04.2024): 157–64. http://dx.doi.org/10.17673/vestnik.2024.01.18.

Der volle Inhalt der Quelle

Annotation:

The article continues the research of the principles of museum design, which was devoted to such phenomenon as “protomuseum – immersion – spectator” and the visual nature of immersiveness and the spatial and sensory experience of its living. At this stage, attention is paid to the following typology of museumified environments: museum-at-the-crossroads (Modern times/ museum-theater, museum without walls, virtual museum, etc.) through the transition from “museum – techno-immersiveness – spectator” to “postmuseum – immersiveness – non-spectator”. The evolution of digital surfing and the construction of interactive strategies, the conflict of technological immersiveness and the cognitive properties of the viewer’s psyche are considered: what happens to him inside and outside the digital environment? Particular attention is paid to the narrative immersiveness and the role of the museum in the implementation of new “ritual” and “game” practices that can compete with the philosophy of downshifting in an attempt to get out of digital reality, return to the viewer the most important sense of “proprioception” and presence in the moment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Bakshutova, Ekaterina. „NETWORK WARS, POLYLOG AND SCRIPT CONVENTION IN SOCIALLY DESTRUCTIVE ONLINE GROUPS“. Vestnik of Samara State Technical University. Psychological and Pedagogical Sciences, Nr. 3 (September 2019): 6–18. http://dx.doi.org/10.17673/vsgtu-pps.2019.3.1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

A.O., Krasniakova. „MODERATION OF POLYLOG AS AN ALGORITM OF TRANSFORMATION COMMUNICATIVE INTERNET PRACTICES“. Scientific Journal of Kherson State University. Series: Psychological Sciences, Nr. 1 (03.04.2019): 228–33. http://dx.doi.org/10.32999/ksu2312-3206/2019-1-38.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Dembowski, Peter F. „Generische Wahrheit—Höfischer Polylog im Werk Jean Froissarts, by Michael Schwartz“. Romance Philology 59, Nr. 1 (Januar 2005): 150–53. http://dx.doi.org/10.1484/j.rph.2.304591.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!