Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 17 of 17 for “"Tree-structured data"”.

  1. In-Memory Storage for Labeled Tree-Structured Data

    In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size w, which permits random accesses to w-bit memory cells. Our data structures …

    waterloo Repository record for In-Memory Storage for Labeled Tree-Structured Data (opens in a new tab)

  2. Scalable Bayesian Inference and Multiple Hypothesis Testing for Tree-structured Data

    … computational algorithms tend to scale poorly as data size increases, partic- ularly for dependent data such as long time series. This has motivated the development of scalable inference methods, including divide-and-conquer and sub-sampling-based ap- proaches. We study the problem of Bayesian …

    duke Repository record for Scalable Bayesian Inference and Multiple Hypothesis Testing for Tree-structured Data (opens in a new tab)

  3. Efficient data search and synchronization for tree-structured data on mobile devices

    We consider two methods about operating data for tree-structured data sets. The first method is to search particular data items and still retains all the important metadata information; the second method is to allow the data synchronization between two tree-structured files. Both of the methods are …

    uoit Repository record for Efficient data search and synchronization for tree-structured data on mobile devices (opens in a new tab)

  4. Hidden at the root : statistical methods for population size estimation on trees

    … fields, populations of interest are hidden from data for a variety of reasons, though their magnitude remains important in determining resource allocation and appropriate policy. One popular approach to population size estimation, the multiplier method, is a back-calculation tool requiring only a …

    ubc Repository record for Hidden at the root : statistical methods for population size estimation on trees (opens in a new tab) Download PDF for Hidden at the root : statistical methods for population size estimation on trees (opens in a new tab)

  5. Visualisation of structured data through generative probabilistic modeling

    … with the construction of topographic maps of structured data. A probabilistic generative model-based approach is taken, inspired by the GTM algorithm. De- pending on the data at hand, the form of a probabilistic generative model is specified that is appropriate for modelling the probability …

    birmingham Download PDF for Visualisation of structured data through generative probabilistic modeling (opens in a new tab)

  6. Tree-sheets and Structured Documents

    For data to be used effectively, it needs to be structured and annotated to make it amenable to machine processing. The Web Consortium's XML markup language promises to allow this, and increasing quantities of data are now available in the format. XML's support for namespacing allows information …

    soton Download file for Tree-sheets and Structured Documents (opens in a new tab)

  7. Προστασία της ιδιωτικότητας στην δημοσίευση μη σχεσιακών δεδομένων

    … on the publications of non-relationaldatasets. The research focuses on proposing and implementing anonymization algorithms whichtransform the datasets to be published, so that the identity of each record and the personal informationof individuals are not revealed.A broad spectrum of …

    greece Repository record for Προστασία της ιδιωτικότητας στην δημοσίευση μη σχεσιακών δεδομένων (opens in a new tab)

  8. Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents

    … of its importance and application in a number of data mining tasks, it has become the focus of many studies. A substantial amount of research has gone into the development of efficient algorithms for mining patterns from large structured or relational data. Compared with the fruitful achievements …

    uts Repository record for Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents (opens in a new tab)

  9. HIGH PERFORMANCE XPATH EVALUATION IN XML STREAMS

    … efficiently evaluating structural queries over tree-structured data streams. A data stream usually consists of a sequence of items that arrive in an order determined by the source. An application that uses such data cannot revisit an earlier item in the stream unless it buffers the item itself. …

    maryland Repository record for HIGH PERFORMANCE XPATH EVALUATION IN XML STREAMS (opens in a new tab)

  10. Processing techniques for partial tree-pattern queries on XML data

    … a de facto standard for exporting and exchanging data on the Web. XML structures data as trees. Querying capabilities are provided through patterns matched against the XML trees. Research on the processing of XML queries has focused mainly on tree-pattern queries. Tree-pattern queries are not …

    njit Repository record for Processing techniques for partial tree-pattern queries on XML data (opens in a new tab)

  11. Labeling dynamic XML documents: An order-centric approach

    The rise of xml as a de facto standard for data exchange and representation has generated a lot of interest on querying XML documents that conform to an ordered tree-structured data model. Labeling schemes facilitate XML query processing by assigning each node in the XML tree a unique label[8, 22, …

    nus Repository record for Labeling dynamic XML documents: An order-centric approach (opens in a new tab) Download file for Labeling dynamic XML documents: An order-centric approach (opens in a new tab)

  12. Semantics and result disambiguation for keyword search on tree data

    … search is a popular technique for searching tree-structured data (e.g., XML, JSON) on the web because it frees the user from learning a complex query language and the structure of the data sources. However, the convenience of keyword search comes with drawbacks. The imprecision of the keyword …

    njit Repository record for Semantics and result disambiguation for keyword search on tree data (opens in a new tab)

  13. A Study on Privacy Preserving Data Publishing With Differential Privacy

    … of an organization, census and statistical data of a country and so on. These data can be represented in different formats such as Numerical and Categorical data, Graph Data, Tree-Structured data and so on. For preventing these data from being illegally exploited and protect it from privacy …

    sask Repository record for A Study on Privacy Preserving Data Publishing With Differential Privacy (opens in a new tab)

  14. Rapid optical metrology of critical dimensions in large-area nanopatterned structures

    … step, I proposed the use of distance-based tree-structured data organization to facilitate data searches with logarithmic speed gains compared to search speeds in databases organized as lists. Growing Self-Organizing Map (GSOM) based unsupervised clustering of the spectral metrology data is …

    texas Repository record for Rapid optical metrology of critical dimensions in large-area nanopatterned structures (opens in a new tab)