Ochanomizu University

Displaying 1-5 of 5 results

  • White Papers // May 2011

    Semi-ShuffledBF: Performance Improvement of a Privacy-Preserving Query Method for a DaaS Model Using a Bloom filter

    In database-as-a-service, users can utilize a database service that is maintained by third parties via the Internet. In such an environment, it becomes difficult for the user to hide confidential information from the data administrator. To solve this problem, the authors previously proposed \"Privacy-Preserving Query Method Hiding Schema Information Using...

    Provided By Ochanomizu University

  • White Papers // Nov 2010

    Compressed Random Access Memory

    Motivated by applications which need to store huge amounts of data in the main memory of a computer, this paper proposes a new dynamic data-structure for compressed random access memory. Ferragina and Venturini recently gave a compressed data-structure for storing a string that allows substrings to be retrieved efficiently, but...

    Provided By Ochanomizu University

  • White Papers // Apr 2009

    An Occlusion-Reduced 3D Hierarchical Data Visualization Technique

    Occlusion is an important problem to be solved for readability improvement of 3D visualization techniques. This paper presents an occlusion reduction technique for cityscape-style 3D visualization techniques. The paper first presents an algorithm for occlusion reduction. It generates bounding boxes of 3D objects on the 2D display space, moves them...

    Provided By Ochanomizu University

  • White Papers // Apr 2009

    Journal Visualization by a Dual Hierarchical Data Visualization Technique

    Researchers often search for specific papers from journals, or look over the trends of the journals. This task is not always easy: for example, various kinds of papers may be extracted if the general terms are use for query operations, and it may prevent to discover the interesting papers. This...

    Provided By Ochanomizu University

  • White Papers // Mar 2009

    A Similarity-Based 3D Time-Varying Data Visualization Technique

    Time-varying data visualization is an active research topic in these years. This paper is currently focusing on visualization of various time-varying data, including weather, gene expression, and atomic plant measurement data. Polyline chart is the most common time-varying data visualization technique. The authors think famous Information Seeking Mantra, which suggests...

    Provided By Ochanomizu University

  • White Papers // Apr 2009

    An Occlusion-Reduced 3D Hierarchical Data Visualization Technique

    Occlusion is an important problem to be solved for readability improvement of 3D visualization techniques. This paper presents an occlusion reduction technique for cityscape-style 3D visualization techniques. The paper first presents an algorithm for occlusion reduction. It generates bounding boxes of 3D objects on the 2D display space, moves them...

    Provided By Ochanomizu University

  • White Papers // Apr 2009

    Journal Visualization by a Dual Hierarchical Data Visualization Technique

    Researchers often search for specific papers from journals, or look over the trends of the journals. This task is not always easy: for example, various kinds of papers may be extracted if the general terms are use for query operations, and it may prevent to discover the interesting papers. This...

    Provided By Ochanomizu University

  • White Papers // Mar 2009

    A Similarity-Based 3D Time-Varying Data Visualization Technique

    Time-varying data visualization is an active research topic in these years. This paper is currently focusing on visualization of various time-varying data, including weather, gene expression, and atomic plant measurement data. Polyline chart is the most common time-varying data visualization technique. The authors think famous Information Seeking Mantra, which suggests...

    Provided By Ochanomizu University

  • White Papers // Nov 2010

    Compressed Random Access Memory

    Motivated by applications which need to store huge amounts of data in the main memory of a computer, this paper proposes a new dynamic data-structure for compressed random access memory. Ferragina and Venturini recently gave a compressed data-structure for storing a string that allows substrings to be retrieved efficiently, but...

    Provided By Ochanomizu University

  • White Papers // May 2011

    Semi-ShuffledBF: Performance Improvement of a Privacy-Preserving Query Method for a DaaS Model Using a Bloom filter

    In database-as-a-service, users can utilize a database service that is maintained by third parties via the Internet. In such an environment, it becomes difficult for the user to hide confidential information from the data administrator. To solve this problem, the authors previously proposed \"Privacy-Preserving Query Method Hiding Schema Information Using...

    Provided By Ochanomizu University