Tadashi Ohmori

27 papers A* 2A 3B 2C 4Misc 1Journal 2Unranked 13

Year	Rank	Type	Title / Venue / Authors
2019	—	`conf`	An Object-Pair Driven Approach for Top-k mCK Query Problem by Using Hilbert R-Tree. TrustCom/BigDataSE Yuan Qiu, Xinhong Hei, Tadashi Ohmori, Hideyuki Fujita
2019	—	`conf`	Comparison Method of Long-term Daily Life Considering the Manner of Spending a Day. KDIR Takahiko Shintani, Tadashi Ohmori, Hideyuki Fujita
2019	—	`conf`	Method for Comparing Long-term Daily Life using Long-duration Episodes. EDBT/ICDT Workshops Takahiko Shintani, Tadashi Ohmori, Hideyuki Fujita
2016	—	`conf`	Pairwise Expansion: A New Topdown Search for mCK Queries Problem over Spatial Web. APWeb (2) Yuan Qiu, Tadashi Ohmori, Takahiko Shintani, Hideyuki Fujita
2016	—	`conf`	Skip Search Approach for Mining Probabilistic Frequent Itemsets from Uncertain Data. KDIR Takahiko Shintani, Tadashi Ohmori, Hideyuki Fujita
2015	C	`conf`	A new algorithm for m-closest keywords query over spatial Web with grid partitioning. SNPD Yuan Qiu, Tadashi Ohmori, Takahiko Shintani, Hideyuki Fujita
2011	Misc	`conf`	Exact top-k keyword search on graph databases. SAC Meirong Wang, Lijun Jiang, Liru Zhang, Tadashi Ohmori
2010	—	`conf`	A System for Keyword Search on Hybrid XML-Relational Databases Using XRjoin. DASFAA (2) Liru Zhang, Tadashi Ohmori, Mamoru Hoshi
2010	—	`conf`	Keyword Search on Hybrid XML-Relational Databases Using XRjoin. DASFAA (1) Liru Zhang, Tadashi Ohmori, Mamoru Hoshi
2009	—	`conf`	Fast Computation of Similarity Based on Jaccard Coefficient for Composition-Based Image Retrieval. PCM Michihiro Kobayakawa, Shigenao Kinjo, Mamoru Hoshi, Tadashi Ohmori, Atsushi Yamamoto
2008	J	`jnl`	A New Feature for Musical Genre Classification of MPEG-4 TwinVQ Audio Data. Inf. Media Technol. Michihiro Kobayakawa, Takaya Morita, Mamoru Hoshi, Tadashi Ohmori
2007	—	`conf`	A New Data Cube for Integrating Data Mining and OLAP. ICDE Workshops Tadashi Ohmori, Masahide Naruse, Mamoru Hoshi
2006	—	`conf`	Mining Web Structures Using Multi-Dimensional Data Mining Model. ICDE Workshops Yoshinobu Yamashita, Tadashi Ohmori, Mamoru Hoshi
2005	—	`conf`	A New Sequence Pattern Search Algorithm N-OPS. ICDE Workshops Guanghao Li, Tadashi Ohmori, Mamoru Hoshi, Yoshinobu Yamashita
2005	A	`conf`	A method for extracting a musical unit to phrase music data in the compressed domain of TwinVQ audio compression. ICME Motohiro Nakanishi, Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori
2004	C	`conf`	Detection of Sequential Patterns of Events for Supporting Business Intelligence Solutions. IDEAS Lilian Harada, Yuuji Hotta, Tadashi Ohmori
2003	A	`conf`	Event analyzer: a tool for sequential data processing. CIKM Lilian Harada, Yuuji Hotta, Naoki Akaboshi, Kazumi Kubota, Tadashi Ohmori, Riichiro Take
2002	C	`conf`	A Novel Datacube Model Supporting Interactive Web-Log Mining. CW Tadashi Ohmori, Y. Tsutatani, Mamoru Hoshi
2001	A	`conf`	A Feature Independent Of Bit Rate For Twinvq Audio Retrieval. ICME Kensuke Onishi, Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori
2000	C	`conf`	An Integration System of Web Information Sources for Mobile Users. IDEAS W. Sae-Tung, Tadashi Ohmori, Mamoru Hoshi
2000	—	`conf`	Integration of Web Information Sources by Mobile Users: Navigational Style of Integration and System Architecture. ADBIS-DASFAA Symposium W. Sae-Tung, Tadashi Ohmori, Mamoru Hoshi
2000	B	`conf`	Robust Texture Image Retrieval Using Hierarchical Correlations of Wavelet Coefficients. ICPR Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori
1995	B	`conf`	Gaming-Simulations of Multi-Agent Information Systems using Large Databases: The Concept and Database Algorithms. DASFAA Tadashi Ohmori, Mamoru Hoshi
1995	J	`jnl`	Parallel database algorithms for solving planning problems on very large databases. Syst. Comput. Jpn. Tadashi Ohmori, Yoshihiro Matsumoto
1991	A*	`conf`	Scheduling Batch Transactions on Shared-Nothing Parallel Database Machines: Effects of Concurrency and Parallelism. ICDE Tadashi Ohmori, Masaru Kitsuregawa, Hidehiko Tanaka
1990	A*	`conf`	Concurrency Control of Bulk Access Transactions on Shared Nothing Parallel Database Machines. ICDE Tadashi Ohmori, Masaru Kitsuregawa, Hidehiko Tanaka
1987	—	`conf`	An Algebraic Deductive Database Managing a Mass of Rule Clauses. IWDM Tadashi Ohmori, Hidehiko Tanaka

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.