Zobrazeno 1 - 10
of 253
pro vyhledávání: '"Shibuya, Tetsuo"'
Autor:
Yamamoto, Akito, Shibuya, Tetsuo
With the growing volume of data in society, the need for privacy protection in data analysis also rises. In particular, private selection tasks, wherein the most important information is retrieved under differential privacy are emphasized in a wide r
Externí odkaz:
http://arxiv.org/abs/2410.10187
We propose an algorithm for counting the number of cycles under local differential privacy for degeneracy-bounded input graphs. Numerous studies have focused on counting the number of triangles under the privacy notion, demonstrating that the expecte
Externí odkaz:
http://arxiv.org/abs/2409.16688
Autor:
Yamamoto, Akito, Shibuya, Tetsuo
With the increasing amount of data in society, privacy concerns in data sharing have become widely recognized. Particularly, protecting personal attribute information is essential for a wide range of aims from crowdsourcing to realizing personalized
Externí odkaz:
http://arxiv.org/abs/2402.07584
We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing graph statistics, including the count of subgraphs, under the edge lo
Externí odkaz:
http://arxiv.org/abs/2312.07055
Autor:
Barish, Robert D., Shibuya, Tetsuo
Publikováno v:
In Theoretical Computer Science 29 December 2024 1022
Autor:
Akdemir, Arda, Shibuya, Tetsuo
Developing high-performing systems for detecting biomedical named entities has major implications. State-of-the-art deep-learning based solutions for entity recognition often require large annotated datasets, which is not available in the biomedical
Externí odkaz:
http://arxiv.org/abs/2011.00425
Morphological information is important for many sequence labeling tasks in Natural Language Processing (NLP). Yet, existing approaches rely heavily on manual annotations or external software to capture this information. In this study, we propose usin
Externí odkaz:
http://arxiv.org/abs/2004.12247
In a previous paper, we introduced special types of fusions, so called simple-ribbon fusions on links. A knot obtained from the trivial knot by a finite sequence of simple-ribbon fusions is called a simple-ribbon knot. Every ribbon knot with <10 cros
Externí odkaz:
http://arxiv.org/abs/1905.04915
Autor:
Onodera, Taku, Shibuya, Tetsuo
Reducing the database space overhead is critical in big-data processing. In this paper, we revisit oblivious RAM (ORAM) using big-data standard for the database space overhead. ORAM is a cryptographic primitive that enables users to perform arbitrary
Externí odkaz:
http://arxiv.org/abs/1804.08285