Dissertations / Theses on the topic 'Methods of representation'
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 'Methods of representation.'
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.
Chang, William. "Representation Theoretical Methods in Image Processing." Scholarship @ Claremont, 2004. https://scholarship.claremont.edu/hmc_theses/160.
Full textHenrysson, Anders. "Procedural Media Representation." Thesis, Linköping University, Department of Science and Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1220.
Full textWe present a concept for using procedural techniques to represent media. Procedural methods allow us to represent digital media (2D images, 3D environments etc.) with very little information and to render it photo realistically. Since not all kind of content can be created procedurally, traditional media representations (bitmaps, polygons etc.) must be used as well. We have adopted an object-based media representation where an object can be represented either with a procedure or with its traditional representation. Since the objects are created on the client the procedures can be adapted to its properties such as screen resolution and rendering performance. To keep the application as small and flexible as possible, each procedure is implemented as a library which is only loaded when needed. The media representation iswritten in XML to make it human readable and easy editable. The application is document driven where the content of the XML document determines which libraries to be loaded. The media objects resulting from the procedures is composited into the media representation preferred by the renderer together with the non-procedural objects. The parameters in the XML document are relative to parameters determined by the system properties (resolution, performance etc.) and hence adapt the procedures to the client. By mapping objects to individual libraries, the architecture is easy to make multi threaded and/or distributed.
Tveit, Amund. "Customizing Cyberspace : Methods for User Representation and Prediction." Doctoral thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1605.
Full textCyberspace plays an increasingly important role in people’s life due to its plentiful offering of services and information, e.g. the Word Wide Web, the Mobile Web and Online Games. However, the usability of cyberspace services is frequently reduced by its lack of customization according to individual needs and preferences.
In this thesis we address the cyberspace customization issue by focusing on methods for user representation and prediction. Examples of cyberspace customization include delegation of user data and tasks to software agents, automatic pre-fetching, or pre-processing of service content based on predictions. The cyberspace service types primarily investigated are Mobile Commerce (e.g. news, finance and games) and Massively Multiplayer Online Games (MMOGs).
First a conceptual software agent architecture for supporting users of mobile commerce services will be presented, including a peer-to-peer based collaborative filtering extension to support product and service recommendations.
In order to examine the scalability of the proposed conceptual software agent architecture a simulator for MMOGs is developed. Due to their size and complexity, MMOGs can provide an estimated “upper bound” for the performance requirements of other cyberspace services using similar agent architectures.
Prediction of cyberspace user behaviour is considered to be a classification problem, and because of the large and continuously changing nature of cyberspace services there is a need for scalable classifiers. This is handled by proposed classifiers that are incrementally trainable, support a large number of classes, and supports efficient decremental untraining of outdated classification knowledge, and are efficiently parallelized in order to scale well.
Finally the incremental classifier is empirically compared with existing classifiers on: 1) general classification data sets, 2) user clickstreams from an actual web usage log, and 3) a synthetic game usage log from the developed MMOG simulator. The proposed incremental classifier is shown to an order of magnitude faster than the other classifiers, significantly more accurate than the naive bayes classifier on the selected data sets, and with insignificantly different accuracy from the other classifiers.
The papers leading to this thesis have combined been cited more than 50 times in book, journal, magazine, conference, workshop, thesis, whitepaper and technical report publications at research events and universities in 20 countries. 2 of the papers have been applied in educational settings for university courses in Canada, Finland, France, Germany, Norway, Sweden and USA.
Jackson, Todd Robert. "Analysis of functionally graded material object representation methods." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/9032.
Full textIncludes bibliographical references (leaves 218-224).
Solid Freeform Fabrication (SFF) processes have demonstrated the ability to produce parts with locally controlled composition. To exploit this potential, methods to represent and exchange parts with varying local composition need to be proposed and evaluated. In modeling such parts efficiently, any such method should provide a concise and accurate description of all of the relevant information about the part with minimal cost in terms of storage. To address these issues, several approaches to modeling Functionally Graded Material (FGM) objects are evaluated based on their memory requirements. Through this research, an information pathway for processing FGM objects based on image processing is proposed. This pathway establishes a clear separation between design of FGM objects, their processing, and their fabrication. Similar to how an image is represented by a continuous vector valued function of the intensity of the primary colors over a two-dimensional space, an FGM object is represented by a vector valued function spanning a Material Space, defined over the three dimensional Build Space. Therefore, the Model Space for FGM objects consists of a Build Space and a Material Space. The task of modeling and designing an FGM object, therefore, is simply to accurately represent the function m(x) where x E Build Space. Data structures for representing FGM objects are then described and analyzed, including a voxel based structure, finite element method, and the extension of the Radial-Edge and Cell-Tuple-Graph data structures mains in order to represent spatially varying properties. All of the methods are capable of defining the function m(x) but each does so in a different way. Along with introducing each data structure, the storage cost for each is derived in terms of the number of instances of each of its fundamental classes required to represent an object. In order to determine the optimal data structure to model FGM objects, the storage cost associated with each data structure for representing several hypothetical models is calculated. Although these models are simple in nature, their curved geometries and regions of both piece-wise constant and non-linearly graded compositions reflect the features expected to be found in real applications. In each case, the generalized cellular methods are found to be optimal, accurately representing the intended design.
by Todd Robert Jackson.
Ph.D.
Harutunian, Vigain. "Representation methods for an axiomatic design process software." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39768.
Full textCureton, Paul. "Drawing in landscape architecture : fieldwork, poetics, methods, translation and representation." Thesis, Manchester Metropolitan University, 2014. http://e-space.mmu.ac.uk/580030/.
Full textZhou, Ying Fu. "A study for orbit representation and simplified orbit determination methods." Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15895/1/Ying_Fu_Zhou_Thesis.pdf.
Full textZhou, Ying Fu. "A Study For Orbit Representation And Simplified Orbit Determination Methods." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15895/.
Full textKarmakar, Priyabrata. "Effective and efficient kernel-based image representations for classification and retrieval." Thesis, Federation University Australia, 2018. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/165515.
Full textDoctor of Philosophy
Ceci, Marcello <1983>. "Interpreting Judgements using Knowledge Representation Methods and Computational Models of Argument." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/6106/1/Marcello_Ceci_tesi.pdf.
Full textCeci, Marcello <1983>. "Interpreting Judgements using Knowledge Representation Methods and Computational Models of Argument." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/6106/.
Full textGenerazio, Hòa. "Consistency of representation for disaggregation from constructive to virtual combat simulations." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/30773.
Full textNygaard, Ranveig. "Shortest path methods in representation and compression of signals and image contours." Doctoral thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2000. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1182.
Full textSignal compression is an important problem encountered in many applications. Various techniques have been proposed over the years for adressing the problem. The focus of the dissertation is on signal representation and compression by the use of optimization theory, more shortest path methods.
Several new signal compression algorithms are presented. They are based on the coding of line segments which are used to spproximate, and thereby represent, the signal. These segments are fit in a way that is optimal given some constraints on the solution. By formulating the compession problem as a graph theory problem, shortest path methods can be applied in order to yeild optimal compresson with respect to the given constraints.
The approaches focused on in this dissertaion mainly have their origin in ECG comression and is often referred to as time domain compression methods. Coding by time domain methods is based on the idea of extracting a subset of significant signals samples to represent the signal. The key to a successful algoritm is a good rule for determining the most significant samples. Between any two succeeding samples in the extracted smaple set, different functions are applied in reconstruction of the signal. These functions are fitted in a wy that guaratees minimal reconstruction error under the gien constraints. Two main categories of compression schemes are developed:
1. Interpolating methods, in which it is insisted on equality between the original and reconstructed signal at the points of extraction.
2. Non-interpolating methods, where the inerpolatian restriction is released.
Both first and second order polynomials are used in reconstruction of the signal. There is solso developed an approach were multiple error measures are applied within one compression algorithm.
The approach of extracting the most significant smaples are further developed by measuring the samples in terms of the number of bits needed to encode such samples. This way we develop an approach which is optimal in the ratedistortion sense.
Although the approaches developed are applicable to any type of signal, the focus of this dissertaion is on the compression of electrodiogram (ECG) signals and image contours, ECG signal compression has traditionally been
Ezzat, Shannon. "Representation Growth of Finitely Generated Torsion-Free Nilpotent Groups: Methods and Examples." Thesis, University of Canterbury. Mathematics and Statistics, 2012. http://hdl.handle.net/10092/7235.
Full textTråsdahl, Øystein. "High order methods for partial differential equations: geometry representation and coordinate transformations." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-17077.
Full textBotes, Danniëll. "Few group cross section representation based on sparse grid methods / Danniëll Botes." Thesis, North-West University, 2012. http://hdl.handle.net/10394/8845.
Full textThesis (MSc Engineering Sciences (Nuclear Engineering))--North-West University, Potchefstroom Campus, 2013.
Jerrelind, Jakob. "Tracking of Pedestrians Using Multi-Target Tracking Methods with a Group Representation." Thesis, Linköpings universitet, Reglerteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-172579.
Full textCsige, Tamás. "K-theoretic methods in the representation theory of p-adic analytic groups." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://dx.doi.org/10.18452/17697.
Full textLet G be a compact p-adic analytic group with no element of order p such that it is the direct sum of a torsion free compact p-adic analytic group H whose Lie algebra is split semisimple and an abelian p-adic analytic group Z of dimension n. In chapter 3, we show that if M is a finitely generated torsion module over the Iwasawa algebra of G with no non-zero pseudo-null submodule, then the image q(M) of M via the quotient functor q is completely faithful if and only if M is torsion free over the Iwasawa algebra of Z. Here the quotient functor q is the unique functor from the category of modules over the Iwasawa algebra of G to the quotient category with respect to the Serre subcategory of pseudo-null modules. In chapter 4, we show the following: Let M, N be two finitely generated modules over the Iwasawa algebra of G such that they are objects of the category Q of those finitely generated modules over the Iwasaw algebra of G which are also finitely generated as modules over the Iwasawa algebra of H. Assume that q(M) is completely faithful and [M] =[N] in the Grothendieck group of Q. Then q(N) is also completely faithful. In chapter 6, we show that if G is any compact p-adic analytic group with no element of order p, then the Grothendieck groups of the algebras of continuous distributions and bounded distributions are isomorphic to c copies of the ring of integers where c denotes the number of p-regular conjugacy classes in the quotient group of G with an open normal uniform pro-p subgroup H of G.
Haines, Cory. "Race, Gender, and Sexuality Representation in Contemporary Triple-A Video Game Narratives." Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/94573.
Full textI examine representations of race, gender, and sexuality in contemporary video-game narratives. I use data from interviews to show how people view their representations in video games and to set a guide for analyzing the games themselves. I analyze a sample of top-selling narrativedriven video games in the United States released from 2016-2019. My content coding incorporates aforementioned interview data as well as theoretical-based and intersectional concepts on video game characters and their narratives. The content analysis includes measures of narrative importance, narrative role, positivity of representation, and demographic categories of characters, though the scale of this study may not allow for a full test of intersectional theory of links between demographics and roles. Interview and content analysis results suggest an overrepresentation of white characters and extreme under-representation of non-white women.
Levy, Joseph Patrick. "Methods of modelling the mental representation of individuals derived from descriptions in text." Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/19049.
Full textMoorhouse, Michael John. "New methods of protein representation and identification of their meaning in a structural context." Thesis, University of Birmingham, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399033.
Full textShanmugam, Divy. "A tale of two time series methods : representation learning for improved distance and risk metrics." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119575.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 43-49).
In this thesis, we present methods in representation learning for time series in two areas: metric learning and risk stratification. We focus on metric learning due to the importance of computing distances between examples in learning algorithms and present Jiffy, a simple and scalable distance metric learning method for multivariate time series. Our approach is to reframe the task as a representation learning problem -- rather than design an elaborate distance function, we use a CNN to learn an embedding such that the Euclidean distance is effective. Experiments on a diverse set of multivariate time series datasets show that our approach consistently outperforms existing methods. We then focus on risk stratification because of its clinical importance in identifying patients at high risk for an adverse outcome. We use segments of a patient's ECG signal to predict that patient's risk of cardiovascular death within 90 days. In contrast to other work, we work directly with the raw ECG signal to learn a representation with predictive power. Our method produces a risk metric for cardiovascular death with state-of-the-art performance when compared to methods that rely on expert-designed representations.
by Divya Shanmugam.
M. Eng.
Handschuh, Stefan. "Numerical methods in Tensor Networks." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-159672.
Full textMARCHISIO, VALERIO. "Malliavin representation formulas for Asian options in a jump-diffusion model." Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2009. http://hdl.handle.net/2108/1001.
Full textWe first develop a unifying Malliavin calculus in a jump-diffusion context, by taking into account all the randomness involved (Brownian motion, jump times and jump amplitudes) and by stating an integration by parts formula which gives the starting point of our work. The results are then applied to study representation formulas both for sensitivities (delta) and conditional expectations (in terms of non conditional Z_t=(X_t,Y_t), in which X stands for a jump diffusion and Y_t=\int_0^t X_r dr. Therefore, the link with problems arising from Finance (price/delta of Asian options) is studied. Several examples are analyzed in details and equipped with numerical studies.
Karagevrekis, Mersini. "Linguistic study of methods of representation of speech and thought in selected Modern Greek literary texts." Thesis, University of Leeds, 1992. http://etheses.whiterose.ac.uk/21073/.
Full textFeng, Yunyi. "Identification of Medical Coding Errors and Evaluation of Representation Methods for Clinical Notes Using Machine Learning." Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1555421482252775.
Full textEason, Christina. "Their Lordships divided? : the representation of women in the transitional House of Lords 1999-2009." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/their-lordships-divided-the-representation-of-women-in-the-transitional-house-of-lords-19992009(77d08d32-d7e2-4b77-afc8-dedd1987d4b7).html.
Full textTissier, Julien. "Improving methods to learn word representations for efficient semantic similarites computations." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSES008.
Full textMany natural language processing applications rely on word representations (also called word embeddings) to achieve state-of-the-art results. These numerical representations of the language should encode both syntactic and semantic information to perform well in downstream tasks. However, common models (word2vec, GloVe) use generic corpus like Wikipedia to learn them and they therefore lack specific semantic information. Moreover it requires a large memory space to store them because the number of representations to save can be in the order of a million. The topic of my thesis is to develop new learning algorithms to both improve the semantic information encoded within the representations while making them requiring less memory space for storage and their application in NLP tasks.The first part of my work is to improve the semantic information contained in word embeddings. I developed dict2vec, a model that uses additional information from online lexical dictionaries when learning word representations. The dict2vec word embeddings perform ∼15% better against the embeddings learned by other models on word semantic similarity tasks. The second part of my work is to reduce the memory size of the embeddings. I developed an architecture based on an autoencoder to transform commonly used real-valued embeddings into binary embeddings, reducing their size in memory by 97% with only a loss of ∼2% in accuracy in downstream NLP tasks
Waswa, Anne, and Mitchelle Wambua. "Teaching and Learning of Mathematics in Sweden : Methods, Resources and Assessment in Mathematics." Thesis, Linnéuniversitetet, Institutionen för utbildningsvetenskap (UV), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-45007.
Full textDragiev, Stanimir [Verfasser], and Marc [Akademischer Betreuer] Toussaint. "An object representation and methods for uncertainty-aware shape estimation and grasping / Stanimir Dragiev. Betreuer: Marc Toussaint." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2015. http://d-nb.info/1071089145/34.
Full textLi, Bowei. "Implementation of full permeability tensor representation in a dual porosity reservoir simulator." Access restricted to users with UT Austin EID Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3034930.
Full textSchiltz, Gary. "Representation of knowledge using Sowa's conceptual graphs : an implementation of a set of tools." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9951.
Full textYus, Diego. "Long-term vehicle movement prediction using Machine Learning methods." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233556.
Full textLokaliserings- eller rörelseprognosering kan beskrivas som uppgiften att förutsäga ett objekts framtida placering med hjälp av de tidigare platserna för objektet. Intresset för problemet ökar i och med införandet av platsbaserade tjänster och autonoma fordon. Även om det är vanligare att studera kortsiktiga förutsägelser, särskilt när det gäller fordon, kan långsiktiga förutsägelser vara användbara i många applikationer som schemaläggning, resurshantering eller trafikprognoser. I detta masterprojekt presenterar jag en feature-representation av rörelse som kan användas för att lära in långsiktiga rörelsemönster och för långsiktig rörelseprediktion både i rymden och tiden. Representationen bygger på periodicitet i data och är baserad på att dela upp banan i fönster och sedan beräkna viktade n-grams av banorna från de olika fönstren. Algoritmen utvärderas på transportdata för tunga transportfordon för att bedöma dess förmåga att från ett sökindex hämta fordon som med stor sannolikhet kommer att röra sig längs en rutt som matchar ett önskat transportuppdrag. Experimentella resultat visar att algoritmen kan uppnå ett konsekvent lågt fel i relativt predikterat avstånd över olika transportlängder i ett begränsat geografiskt område under verkliga förhållanden. Resultaten indikerar även att den totala populationen av fordon i indexet är en kritisk faktor för algoritmens prestanda och därmed även för dess applicerbarhet för verklig användning.
Tomczak, Jakub. "Algorithms for knowledge discovery using relation identification methods." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2563.
Full textDouble Diploma Programme, polish supervisor: prof. Jerzy Świątek, Wrocław University of Technology
Hannu, Louise. "Representation inom barnens litterära värld : Normalisera icke-normativt innehåll." Thesis, Luleå tekniska universitet, Institutionen för ekonomi, teknik och samhälle, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-79712.
Full textI dagens samhälle finns det många böcker som är avsedda att skapa mångfald med ett mer inkluderande innehåll men detta leder ofta till ett innehåll fullt av stereotyper. Böckerna blir stigmatiserade snarare än representativa. Detta är ett stort problem då barn lär sig mycket via böcker, även i den teknologiska värld vi lever i just nu. Det är därför boken Pim & Purpurfolket gjordes. Detta examensarbete, skapat av Louise Hannu vid Luleå Tekniska Universitet, handlar om att analysera och trotsa den pågående, stereotypa trend inom barnens litterära värld genom att använda en normkreativ strategi.
Fukumori, Ichiro. "Efficient representation of the hydrographic structure of the north Atlantic Ocean and aspects of the circulation from objective methods." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/52903.
Full textIncludes bibliographical references (leaves 232-236).
by Ichiro Fukumori.
Ph.D.
Khac, Do Nguyen. "Situated cognition and Agile software development: A comparison of three methods." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-62824.
Full textLundberg, Jacob. "Resource Efficient Representation of Machine Learning Models : investigating optimization options for decision trees in embedded systems." Thesis, Linköpings universitet, Statistik och maskininlärning, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162013.
Full textDistel, Felix. "Learning Description Logic Knowledge Bases from Data Using Methods from Formal Concept Analysis." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-70199.
Full textWang, Yuancheng. "Performance of supertree methods for estimating species trees." Thesis, University of Canterbury. Mathematics and Statistics, 2010. http://hdl.handle.net/10092/4644.
Full textCsige, Tamás [Verfasser], Elmar [Gutachter] Groÿe-Klönne, Peter [Gutachter] Schneider, and Gergely [Gutachter] Zábrádi. "K-theoretic methods in the representation theory of p-adic analytic groups / Tamás Csige ; Gutachter: Elmar Groÿe-Klönne, Peter Schneider, Gergely Zábrádi." Berlin : Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://d-nb.info/1126004200/34.
Full textBudinich, Renato [Verfasser], Gerlind [Akademischer Betreuer] Plonka-Hoch, Gerlind [Gutachter] Plonka-Hoch, and Armin [Gutachter] Iske. "Adaptive Multiscale Methods for Sparse Image Representation and Dictionary Learning / Renato Budinich ; Gutachter: Gerlind Plonka-Hoch, Armin Iske ; Betreuer: Gerlind Plonka-Hoch." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2019. http://d-nb.info/1175625396/34.
Full textZokka, Herman Kankara. "Presentation and representation of environmental problems and problem-solving methods and processes in the Grade 10 Geography syllabus: a Namibian case study." Thesis, Rhodes University, 2016. http://hdl.handle.net/10962/d1021253.
Full textEcheverri, Daniel Ricardo. "Application of the Deconstructive Discourse as a Generative Thinking Framework." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1399283791.
Full textBodin, Camilla. "Automatic Flight Maneuver Identification Using Machine Learning Methods." Thesis, Linköpings universitet, Reglerteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-165844.
Full textJia, Yue Verfasser], Timon [Akademischer Betreuer] Rabczuk, Klaus [Gutachter] [Gürlebeck, and Alessandro [Gutachter] Reali. "Methods based on B-splines for model representation, numerical analysis and image registration / Yue Jia ; Gutachter: Klaus Gürlebeck, Alessandro Reali ; Betreuer: Timon Rabczuk." Weimar : Institut für Strukturmechanik, 2015. http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20151210-24849.
Full textJia, Yue [Verfasser], Timon [Akademischer Betreuer] Rabczuk, Klaus [Gutachter] Gürlebeck, and Alessandro [Gutachter] Reali. "Methods based on B-splines for model representation, numerical analysis and image registration / Yue Jia ; Gutachter: Klaus Gürlebeck, Alessandro Reali ; Betreuer: Timon Rabczuk." Weimar : Institut für Strukturmechanik, 2015. http://d-nb.info/1116366770/34.
Full textDing, Hui. "Level of detail for granular audio-graphic rendering : representation, implementation, and user-based evaluation." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00913624.
Full textGreenberg, Jane. "A Comparison of Web Resource Access Experiments:Planning for the New Millennium." the Library of Congress, 2000. http://hdl.handle.net/10150/105784.
Full textGARBARINO, DAVIDE. "Acknowledging the structured nature of real-world data with graphs embeddings and probabilistic inference methods." Doctoral thesis, Università degli studi di Genova, 2022. http://hdl.handle.net/11567/1092453.
Full text