Dissertations / Theses on the topic 'CUFTS'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'CUFTS.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Prabhaker, Sumanth. "Village of cults /." Electronic version (PDF), 2007. http://dl.uncw.edu/etd/2007-3/prabhakers/sumanthprabhaker.pdf.
Full textDANIELSSON, JESPER. "Functional Cuts." Thesis, Högskolan i Borås, Institutionen Textilhögskolan, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-17351.
Full textProgram: Modedesignutbildningen
Bonsma, Paul Simon. "Sparse cuts, matching-cuts and leafy trees in graphs." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/57117.
Full textRipley, Marianne. "Charismatic Cults and Leadership." Honors in the Major Thesis, University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/795.
Full textBachelors
Arts and Sciences
Psychology
Graninger, Charles Denver. "Regional cults of Thessaly." [S.l. : s.n.], 2006. http://books.google.com/books?id=wl_XAAAAMAAJ.
Full textStafford, Emma Josephine. "Greek cults of deified abstractions." Thesis, University College London (University of London), 1994. http://discovery.ucl.ac.uk/1317665/.
Full textZhang, Jiaxin. "Power-law Graph Cuts." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1418749967.
Full textLenz, Robert W. "A biblical response for a cargo cult society in Irian Jaya Indonesia." Theological Research Exchange Network (TREN), 1988. http://www.tren.com.
Full textRangos, Spyridon. "Cults of Artemis in Ancient Greece." Thesis, University of Cambridge, 1996. https://www.repository.cam.ac.uk/handle/1810/244861.
Full textNorris, Kelly J. "Cults, ritualistic abuse, and false memories /." View online, 1993. http://repository.eiu.edu/theses/docs/32211998759422.pdf.
Full textHamrawi, Hussam. "Type-2 fuzzy alpha-cuts." Thesis, De Montfort University, 2011. http://hdl.handle.net/2086/5137.
Full textCavaniglia, Consuelo. "Open cuts: spaces, surfaces, shadows." Thesis, The University of Sydney, 2016. http://hdl.handle.net/2123/16317.
Full textDeBusk, James Robert. "Christians preparing to witness to the cults." Theological Research Exchange Network (TREN), 1988. http://www.tren.com.
Full textButz, Martin J. "An inquiry into the paradox of aberrant Christian churches orthodoxy without orthopraxy /." Theological Research Exchange Network (TREN), 1991. http://www.tren.com.
Full textLewis, James. "New religions and the struggle for legitimacy." Thesis, University of Wales Trinity Saint David, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.683299.
Full textMüller, Irene. "Corner cuts and corner cut polytopes." Zurich : [ETH Zurich, Department of Mathematics], 2001. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=26.
Full textLi, Nan. "AIG Rewriting Using 5-Input Cuts." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-37227.
Full textTewari, Gaurav. "Centralized packaging of retail meat cuts." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0022/NQ51672.pdf.
Full textZekavat, Mahdi S. Mohammad. "Orderings, cuts and formal power series." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ63973.pdf.
Full textPeters, Thomas A. "Appealing cults in central Africa a scriptural perspective /." Theological Research Exchange Network (TREN), 1987. http://www.tren.com.
Full textPurday, K. M. "Minor healing cults within Athens and its environs." Thesis, University of Southampton, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379312.
Full textPiroyansky, Danna. "Cults of political martyrs in late medieval England." Thesis, Queen Mary, University of London, 2005. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1873.
Full textSchenck, Catherine Alexandria, and Catherine Alexandria Schenck. "Serving the Gods Together: Gender in Roman Cults." Thesis, The University of Arizona, 2017. http://hdl.handle.net/10150/625282.
Full textCornelsen, Sabine. "Drawing families of cuts in a graph." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=967110165.
Full textEnglish, Carol. "Visual temporal masking at video scene cuts." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ26916.pdf.
Full textIkram, Salima. "Choice cuts : meat production in Ancient Egypt." Thesis, University of Cambridge, 1992. https://www.repository.cam.ac.uk/handle/1810/272370.
Full textKulkarni, Mayuresh. "Image and video segmentation using graph cuts." Master's thesis, University of Cape Town, 2010. http://hdl.handle.net/11427/5190.
Full textEbrahim, Rafee E. "Fuzzy logic programming based on alpha-cuts." Thesis, De Montfort University, 2003. http://hdl.handle.net/2086/13274.
Full textEnglish, Carol (Carol Anne Rachel) Carleton University Dissertation Psychology. "Visual temporal masking at video scene cuts." Ottawa, 1997.
Find full textLindström, Alfred Minh. "Cutting and Destroying Graphs using k-cuts." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-395663.
Full textShterin, Marat. "'Cult controveries' in contemporary England and Russia : a sociological comparison." Thesis, London School of Economics and Political Science (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.271152.
Full textGlowski, Janice M. "Living goddess as incarnate image : the Kumārī Cult of Nepal /." Connect to this title online, 1995. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1105391104.
Full textClark, Jeffrey L. "From cults to Christianity : continuity and change in Takuru /." Title page, contents and abstract only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phc593.pdf.
Full textMai, Cuong T. "Visualization apocrypha and the making of Buddhist deity cults in early medieval China with special reference to the cults of Amitabha, Maitreya, and Samantabhadra /." [Bloomington, Ind.] : Indiana University, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3380107.
Full textTitle from PDF t.p. (viewed on Jul 14, 2010). Source: Dissertation Abstracts International, Volume: 70-12, Section: A, page: 4722. Adviser: John R. McRae.
Serrano, Musalem Felipe. "Some experiments on separation with multi-row cuts." Tesis, Universidad de Chile, 2013. http://www.repositorio.uchile.cl/handle/2250/114463.
Full textIngeniero Civil Industrial
Since Andersen et al. there has been a lot of interest in multi-row cuts. However, computational study has been limited. Most research consider multi-row cuts deduced from only 2 rows and they use bounds on none or only on one type of variables, always relaxing integrality of non-basic variables when bounds are taken into account. Also, most applications aim to exact separation as well as using fixed convex lattice free bodies to separate. In this work we try a numerical approach that allows us to look into more complex relaxations and we introduce an approximated separation hoping for a practical implementation to be possible. Extensively numerical analysis has been done to ensure numerical stability and minimize the creation of false cuts. Also, we incorporate some simple forms of taking advantage of integrality of non basic variables. Once the rows of a tableau are obtained we search for a ``deep cut'' which we understand as a cut ($\alpha x \ge 1$) that minimizes $\norm{\alpha}$. To find it, we solve the dual using a column generation approach. We tested both, $\l^1-$norm and $\l^2-$norm, where the latter one is treated using Ben-Tal and Nemirovsky approximation of the second order cone. In order to speed up the process we seek for violated representations of fixed points. Different criteria for row selection is tested: random selection, largest dot product and smallest dot product. To give a more complete idea about the strength of multi-rows cuts, we also generated all possible cuts using all combination of rows, but without aggregation of rows. We compare this to Balas computations of the split closure. As for the experiments done in this work, we analyze the impact in the root node of the procedure (using various rounds) over MIPLIB3. Also, we select a good configuration and test its performance in branch and bound.
Trillos, Nicolás Garcia. "Variational Limits of Graph Cuts on Point Clouds." Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/518.
Full textOLIVEIRA, CARLOS VINICIUS SOUSA DE. "DISPARITY MAPS USING GRAPH CUTS WITH MULTI-RESOLUTION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2010. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=16430@1.
Full textReconstruir a informação 3D de uma cena é uma tarefa bastante comum em Visão Computacional. Uma das técnicas mais utilizadas para realizar esta tarefa é a correspondência por estéreo, que consiste basicamente em, dadas duas imagens referentes a uma mesma cena vista de pontos diferentes, determinar os pontos correspondentes entre essas duas imagens e armazenar essa informação em um mapa de disparidades. Até hoje diversos métodos foram propostos para resolver o problema de estéreo com esforço computacional viável e mantendo a qualidade dos resultados. Essa, entretanto, é uma tarefa bastante árdua e que difícilmente alcança resultados precisos com pouco esforço computacional. Nesse âmbito, uma técnica que tem sido muito estudada são os Cortes de Grafo (Graph Cuts), que almeja resolver o problema de minimização de energia em tempo polinomial. Nesse caso o problema de estéreo é mapeado como um problema de minimização de energia e desta forma solucionado utilizando cortes de grafo. Neste trabalho estudamos as técnicas de cortes de grafo mais recentes e eficientes e propomos um método para a determinação de correspondências entre duas imagens num contexto de multi-resolução, no qual uma pirâmide Gaussiana para as imagens é construída e a técnica de cortes de grafo é aplicada em níveis menores, otimizando a performance e obtendo resultados mais precisos através da utilização do algoritmo de expansão-alfa. São revisadas as técnicas de cortes de grafo e de multi-resolução e os resultados obtidos são apresentados e avaliados em relação a métodos semelhantes.
Reconstructing the 3D information of a scene is a common task in Computer Vision. Stereo matching is one of the most investigated techniques used to perform this task, which basically consists of, given two images of a scene seen from different view points, determining corresponding pixels in these two images and store this information in a disparity map. Several methods have been proposed to solve the stereo problem keeping good performance and giving good quality results. This is however a very arduos task which hardly achieves precise results with low computational power. In this context, the Graph Cuts method has been very much considered, which aims to solve the energy minimization problem in polinomial time. In this case the stereo problem can be modelled as an energy minimization problem and, thus solved using the Graph Cuts technique. In this work we investigate the most recent and efficient Graph Cuts methods and propose a method for establishing the correspondences between two images in the context of multi-resolution, in which a Gaussian pyramid for the input images is built and the Graph Cuts methods is applied in coarser levels, optimizing the performance and getting more precise results through the use of the alfa-expansion algorithm. The Graph Cuts and multi-resolution techniques are reviewed and the results of the proposed method are presented and evaluated compared to similar methods.
López, Martínez Andrés. "Parallel Minimum Cuts : An improved CREW PRAM algorithm." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287962.
Full textDenna avhandling behandlar minsta-snittproblemet i oriktade, viktade grafer. För att hitta det minsta snittet i en graf G med n noder och m kanter presenterar vi en enkel slumpbaserad CREW PRAM algoritm som är baserad på Kargers berömda, slumpbaserade, minsta-snittalgoritm med nära-linjär körtid [STOC’96]. Vår algoritm kräver nära-linjärt arbete O(m log2 n + n log6 n) och lågt djup O(log3 n), och är korrekt med hög sannolikhet. Detta är den första förbättringen till den tidigare bästa CREW PRAM minsta-snittalgoritmen av Geissmann och Gianinazzi [SPAA’18] som kräver O(m log4 n) arbete och har O(log3 n) djup. I sin slumpbaserade och nära-linjära minsta-snittalgoritm använder sig Karger av ett samband mellan minsta snitt och maximala packningar av uppspännande träd vilket förminskar problemet till två delproblem: (i) beräkna en approximativ maximal packning av uppspännande träd S, och (ii) hitta minsta snittet av grafen G som har som mest två kanter i något träd i S—känt som det 2- respekterande minsta-snittproblemet. För att åstadkomma vårt huvudresultat ger vi parallella algoritmer för båda delproblemen. Mer specifikt så presenterar vi följande. En CREW PRAM algoritm för det 2-respekterande minsta-snittproblemet som kräver O (m log n+n log5 n) arbete och vars djup är O(log2 n). Vi erhåller detta från att parallellisera en ny sekventiell algoritm av Mukhopadhay och Nanongkai [STOC’20] vilken i sig förbättrar Kargers ursprungliga resultat. En EREW PRAM algoritm för att beräkna en approximtiv maximal packning av uppspännande träd som kräver O (m log2 n + n log4 n) arbete och vars djup är O (log3 n). Detta förbättrar den tidigare bästa gränsen för minsta arbete med en faktor log n, hävdad av Karger [STOC 96], och som används av Geissmann och Gianinazzi [SPAA 18]. Utöver detta utvecklar vi följande självständiga resultat: En parallell implementation av ett värdemängdsträd i två dimensioner: givet en mängd av n viktade punkter i planet så kan den konstrueras genom O(n log n) arbete och med O(log2 n) djup genom en EREW PRAM algoritm. I CREW PRAM modellen så stödjer den värdemängdsräkning, värdemängdsrapportering, och förfrågor om värdemängdssummationer optimalt med avseende på arbetet och med O(log n) djup. En sekventiell algoritm med O(log2 n + t log n) körtid för att besvara en förfrågan av ett 2-dimensionellt viktat värdemängdsstickprov i ett värdemängdsträd på n viktade punkter. Förfrågan definieras som följande: givet ett heltal t, välj slumpmässigt oberoende t punkter ur en värdetalsmängd. Varje punkt väljs med sannolikhet proportionell till sin vikt. I CREW PRAM modellen visar vi hur man kan stödja förfrågan optimalt med avseende på arbetet och med O(log n) djup.
collins, jacqueline Avery. "the moon cuts like pye, but not cherry." VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/4902.
Full textSouto, Gonçalves De Abreu Samuel François. "Cuts, discontinuities and the coproduct of Feynman diagrams." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/14173.
Full textAsmar, Ghazi H. "Stress analysis of anisotropic plates containing rectangular cuts /." free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9901214.
Full textNaoum, Danai-Christina. "The Hellenisation of Isis and the spread of the cults." Thesis, University of Liverpool, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490806.
Full textHudson, Alison. "Æthelwold's circle, saints' cults, and monastic reform, c.956-1006." Thesis, University of Oxford, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.669730.
Full textMooney, Annabelle Nell. "Terms of use and abuse : the recruiting rhetoric of cults." Thesis, University of Glasgow, 2001. http://theses.gla.ac.uk/6411/.
Full textWahlberg, Nina May. "Goddess cults in Egypt between 1070 BC and 332 BC." Thesis, University of Birmingham, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289446.
Full textSmith, Justin T. "Cult films and film cults in British cinema 1968-86." Thesis, University of Portsmouth, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.429782.
Full textGarland, Lisa Margaret. "Aspects of Welsh saints' cults and pilgrimage c. 1066-1530." Thesis, King's College London (University of London), 2005. https://kclpure.kcl.ac.uk/portal/en/theses/aspects-of-welsh-saints-cults-and-pilgrimage-c-10661530(92aa8513-28c6-44e0-b1d7-20c27d3265a5).html.
Full textKader, Ariz. "Cults of Martyrdom : Exploring Rebel Cohesion Using Identity Fusion Theory." Thesis, Uppsala universitet, Institutionen för freds- och konfliktforskning, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-445194.
Full textLathrop, Benjamin A. "Cult films and film cults : the evil dead to Titanic /." Ohio : Ohio University, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1090934488.
Full textBaumbach, Jens David. "The significance of votive offerings in selected Hera sanctuaries in the Peloponnese, Ionia and western Greece." Thesis, University of Oxford, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248843.
Full text