Letteratura scientifica selezionata sul tema "Polylgot"

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Polylgot".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Polylgot"

1

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

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Vogt, Nina. "Lineage tracing with Polylox barcodes". Nature Methods 14, n. 10 (29 settembre 2017): 940. http://dx.doi.org/10.1038/nmeth.4451.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Ahn, Kook Jin, Graham Cormode, Sudipto Guha, Andrew McGregor e Anthony Wirth. "Correlation Clustering in Data Streams". Algorithmica 83, n. 7 (13 marzo 2021): 1980–2017. http://dx.doi.org/10.1007/s00453-021-00816-9.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Ben-Sasson, Eli, e Madhu Sudan. "Short PCPs with Polylog Query Complexity". SIAM Journal on Computing 38, n. 2 (gennaio 2008): 551–607. http://dx.doi.org/10.1137/050646445.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Tesi sul tema "Polylgot"

1

Schwarze, Michael. "Generische Wahrheit : höfischer Polylog im Werk Jean Froissarts /". Stuttgart : F. Steiner, 2003. http://catalogue.bnf.fr/ark:/12148/cb412914783.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Rößler, Jens [Verfasser], e Thomas [Akademischer Betreuer] Höfer. "Applications of Polylox barcoding to the hematopoietic system / Jens Rößler ; Betreuer: Thomas Höfer". Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1217163824/34.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Wermann, Hartmut [Verfasser], e Hans P. [Akademischer Betreuer] Sturm. "Natur und Kultur im Polylog: Widerstreit und Harmonie des Denkens / Hartmut Wermann. Betreuer: Hans P. Sturm". Augsburg : Universität Augsburg, 2012. http://d-nb.info/1077700857/34.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Шульженко, Олександра Валентинівна. "Специфіка трагікомедій Неди Неждани «Дирижабль», «Колона черепах», «Той, що відчиняє двері», «Коли повертається дощ»". Магістерська робота, 2020. https://dspace.znu.edu.ua/jspui/handle/12345/1868.

Testo completo
Abstract (sommario):
Шульженко О. В. Специфіка трагікомедій Неди Неждани «Дирижабль», «Колона черепах», «Той, що відчиняє двері», «Коли повертається дощ» : кваліфікаційна робота магістра спеціальності 035 «Філологія» / наук. керівник В. О. Кравченко. Запоріжжя : ЗНУ, 2020. 64 с.
UA : Кваліфікаційна робота магістра «Специфіка трагікомедій Неди Неждани «Дирижабль», «Колона черепах», «Той, що відчиняє двері», «Коли повертається дощ» містить 64 сторінки. Для виконання роботи опрацьовано 60 джерел. Мета дослідження: розкрити специфіку та проаналізувати драматичні твори Неди Нежданої. У ході написання роботи виконано такі завдання: - досліджено особливості сучасного драматургічного тексту; - з’ясовано жанрові трансформації драматичних текстів ХІІ століття; - проаналізовано композиційні складові драматургічних текстів «Дирижабль», «Колона черепах», «Коли повертається дощ», «Той, що відчиняє двері»; - визначено особливості образної системи трагікомедій; - проаналізовано мовно-структурні елементи в трагікомедіях; Об’єкт дослідження: Трагікомедії: «Дирижабль», «Колона черепах», «Коли повертається дощ», «Той, що відчиняє двері» та інші. Предмет дослідження: специфіка організації і побудови трагікомедій Неди Нежданої. Методи дослідження. У роботі використано такі методи дослідження: аналіз, синтез, аналітично-описовий метод, теоретичне узагальнення. Наукова новизна роботи полягає в тому, що вона є першою спробою ґрунтовного аналізу та дослідження специфіки драматичних творів Неди Нежданої.
EN : Master's qualification work «The Specific of Tragicomedy «Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns» by the Neda Nezhdana» contains 64 pages. 60 sources were processed for the work. The aim of the study: to discover the specific and analyze the dramatic works of Neda Nezhdana. During the writing of the work the following tasks were performed: - features of modern dramaturgical text have been investigated; - the genre transformations of dramatic texts of the XII century are clarified; - the compositional components of the dramatic texts «Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns» are analyzed; - the features of the figurative system of tragicomedies were determined; - linguistic and structural elements in tragicomedy are analyzed. Object of study: Tragicomedy: Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns»; Subject of research: the specifics of the organization and construction of the tragicomedy by the Neda Nezhdana Research methods. The following research methods are used in the work: analysis, synthesis, analytical and descriptive method, theoretical generalization. The scientific novelty of the work is that it is the first attempt at a thorough analysis and study of the specifics of Neda Nezhdana dramatic works. The scope of the work is that its materials can be used in the further development of the literary problems of the chosen theme, leading courses and special seminars on the history of Ukrainian literature of the twentieth century, when writing term papers, as well as elective courses on the history of Ukrainian literature at schools.
Gli stili APA, Harvard, Vancouver, ISO e altri

Libri sul tema "Polylgot"

1

1954-, Mādhava Harṣadeva, a cura di. Amarakośaḥ: Sacitraḥ caturbhāṣāśobhitaḥ = multilingual ancient Sanskrit dictionary. Ahamadāvāda: Pārśva Pablikeśana, 2009.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Daniela, Stamatiadi, a cura di. He polylogou. Athens: Ekdoseis Parachos L. Kalfakis, 2003.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Flídrová, Helena. Sociolingvistické a psycholingvistické aspekty dialogu a polylogu v ruštině. Praha: Státní pedagogické nakl., 1989.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

1963-, DeLossa Robert A., a cura di. [Rozmovli͡a︡ĭmo!] =: Let's talk! : a basic Ukrainian course with polylogs, grammar, and conversation lessons. Bloomington, Ind: Slavica Publishers, 2004.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Mediale levenskunst: Een interculturele polyloog. Brussel: ASP, 2014.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Generische Wahrheit: Höfischer Polylog im Werk Jean Froissarts. Stuttgart: F. Steiner, 2003.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Kellermann, Paul. Die Geldgesellschaft und Ihr Glaube: Ein Interdisziplinärer Polylog. VS Verlag fur Sozialwissenschaften GmbH, 2007.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Die Geldgesellschaft und ihr Glaube: Ein interdisziplina rer Polylog. Wiesbaden: VS Verl. fu r Sozialwissenschaften, 2007.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Royé, Hans-Walter. Segmentierung und Hervorhebung in Gesprochener Deutscher Standardsprache. Analyse Eines Fernseh-Polylogs. de Gruyter GmbH, Walter, 2017.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Romanchuk, Robert, Robert A. Delossa, R. Robert Koropeckyj e Alexandra Isaievych Mason. Rozmovliaimo! (Let's Talk!): A Basic Ukrainian Course With Polylogs, Grammar, And Conversation Lessons. Slavica Pub, 2005.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Polylgot"

1

Hartz, Peter, e Hilarion G. Petzold. "Der POLYLOG". In Wege aus der Arbeitslosigkeit, 117–26. Wiesbaden: Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-03708-6_9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Dübgen, Franziska. "Gerechtigkeit im Polylog". In Transkulturelle Politische Theorie, 265–84. Wiesbaden: Springer Fachmedien Wiesbaden, 2015. http://dx.doi.org/10.1007/978-3-658-05010-8_13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Gentry, Craig, Shai Halevi e Nigel P. Smart. "Fully Homomorphic Encryption with Polylog Overhead". In Advances in Cryptology – EUROCRYPT 2012, 465–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29011-4_28.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Glaßer, Christian. "Polylog-Time Reductions Decrease Dot-Depth". In STACS 2005, 170–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31856-9_14.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Schechtman, Gideon, e Nicole Tomczak-Jaegermann. "Polylog Dimensional Subspaces of $$\ell _\infty ^N$$". In Lecture Notes in Mathematics, 325–34. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46762-3_15.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Peleg, David, e Eilon Reshef. "Deterministic polylog approximation for minimum communication spanning trees". In Automata, Languages and Programming, 670–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055092.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Azarmehr, Amir, Soheil Behnezhad e Mohammad Roghani. "Fully Dynamic Matching: -Approximation in Polylog Update Time". In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3040–61. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.109.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Rothblum, Guy N., e Ron D. Rothblum. "Batch Verification and Proofs of Proximity with Polylog Overhead". In Theory of Cryptography, 108–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64378-2_5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Kolman, Petr. "Approximating Spanning Tree Congestion on Graphs with Polylog Degree". In Lecture Notes in Computer Science, 497–508. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63021-7_38.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Holm, Jacob, e Eva Rotenberg. "Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity". In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2378–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.146.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Polylgot"

1

Roos, Stefanie, e Thorsten Strufe. "Provable Polylog Routing for Darknets". In 2012 32nd International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). IEEE, 2012. http://dx.doi.org/10.1109/icdcsw.2012.24.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Chandra, Tushar Deepak. "Polylog randomized wait-free consensus". In the fifteenth annual ACM symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/248052.248083.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Saks, Michael, Aravind Srinivasan e Shiyu Zhou. "Explicit dispersers with polylog degree". In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225188.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Meel, Kuldeep S., Aditya A. Shrotri e Moshe Y. Vardi. "Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract)". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/865.

Testo completo
Abstract (sommario):
The problem of counting the number of solutions of a DNF formula, also called #DNF, is a fundamental problem in AI with wide-ranging applications. Owing to the intractability of the exact variant, efforts have focused on the design of approximate techniques. Consequently, several Fully Polynomial Randomized Approximation Schemes (FPRASs) based on Monte Carlo techniques have been proposed. Recently, it was discovered that hashing-based techniques too lend themselves to FPRASs for #DNF. Despite significant improvements, the complexity of the hashing-based FPRAS is still worse than that of the best Monte Carlo FPRAS by polylog factors. Two questions were left unanswered in previous works: Can the complexity of the hashing-based techniques be improved? How do these approaches compare empirically? In this paper, we first propose a new search procedure for the hashing-based FPRAS that removes the polylog factors from its time complexity. We then present the first empirical study of runtime behavior of different FPRASs for #DNF, which produces a nuanced picture. We observe that there is no single best algorithm for all formulas and that the algorithm with one of the worst time complexities solves the largest number of benchmarks.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Haeupler, Bernhard, Shyamal Patel, Antti Roeyskoe, Cliff Stein e Goran Zuzic. "Polylog-Competitive Deterministic Local Routing and Scheduling". In STOC '24: 56th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2024. http://dx.doi.org/10.1145/3618260.3649678.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Bartal, Yair, Avrim Blum, Carl Burch e Andrew Tomkins. "A polylog(n)-competitive algorithm for metrical task systems". In the twenty-ninth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/258533.258667.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Chandra, Tushar Deepak, Prasad Jayanti e King Tan. "A polylog time wait-free construction for closed objects". In the seventeenth annual ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/277697.277753.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Ferrarotti, Flavio, Senen Gonzalez, Klaus-Dieter Schewe e Jose Mariia Turull-Torres. "The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic". In 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2018. http://dx.doi.org/10.1109/synasc.2018.00032.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Uchima, H., L. Torrealba, C. Huertas, M. Hombrados, M. Figa, R. Louvriex, S. Arjona e X. Aldeguer. "ENDOSCOPIC FULL THICKNESS RESECTION IN THE RECTUM CLOSED WITH POLYLOOP AND CLIPS". In ESGE Days 2018 accepted abstracts. Georg Thieme Verlag KG, 2018. http://dx.doi.org/10.1055/s-0038-1637337.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Räcke, Harald, Stefan Schmid e Ruslan Zabrodin. "Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands". In SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3558481.3591097.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia