H Liu, YS Ong, J Cai - Structural and Multidisciplinary Optimization, 2018 - Springer
Metamodeling is becoming a rather popular means to approximate the expensive simulations in today's complex engineering design problems since accurate metamodels …
L Ke, M Danelljan, X Li, YW Tai… - Proceedings of the …, 2022 - openaccess.thecvf.com
Two-stage and query-based instance segmentation methods have achieved remarkable results. However, their segmented masks are still very coarse. In this paper, we present …
“Nature shows us only the tail of the lion. But I do not doubt that the lion belongs to it even though he cannot at once reveal himself because of his enormous size.”–Albert Einstein The …
S Guha, N Mishra, G Roy… - … conference on machine …, 2016 - proceedings.mlr.press
In this paper we focus on the anomaly detection problem for dynamic data streams through the lens of random cut forests. We investigate a robust random cut data structure that can be …
Data acquisition in large‐scale scenes regularly involves accumulating information across multiple scans. A common approach is to locally align scan pairs using Iterative Closest …
Data Mining: Concepts and Techniques, Fourth Edition introduces concepts, principles, and methods for mining patterns, knowledge, and models from various kinds of data for diverse …
This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the …
Problems with multiple objectives arise in a natural fashion in most disciplines and their solution has been a challenge to researchers for a long time. Despite the considerable …
JL Bentley - Communications of the ACM, 1975 - dl.acm.org
This paper develops the multidimensional binary search tree (or kd tree, where k is the dimensionality of the search space) as a data structure for storage of information to be …