|
|
|
|
|
Kenneth Lange
The current paper proposes and tests algorithms for finding the diameter of a compact convex set and the farthest point in the set to another point. For these two nonconvex problems, I construct Frank?Wolfe and projected gradient ascent algorithms. Altho...
ver más
|
|
|
|
|
|
|
|
|
|
|
Keno Jann Büscher, Jan Philipp Degel and Jan Oellerich
This paper provides a comprehensive overview of approaches to the determination of isocontours and isosurfaces from given data sets. Different algorithms are reported in the literature for this purpose, which originate from various application areas, suc...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kenneth Lange
The Hausdorff distance between two closed sets has important theoretical and practical applications. Yet apart from finite point clouds, there appear to be no generic algorithms for computing this quantity. Because many infinite sets are defined by algeb...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alessio Bottrighi, Marco Guazzone, Giorgio Leonardi, Stefania Montani, Manuel Striani and Paolo Terenziani
The traces of process executions are a strategic source of information, from which a model of the process can be mined. In our recent work, we have proposed SIM (semantic interactive miner), an innovative process mining tool to discover the process model...
ver más
|
|
|
|
|
|
|
|
|
|
|
Imene Bareche and Ying Xia
The magnitude of highly dynamic spatial data is expanding rapidly due to the instantaneous evolution of mobile technology, resulting in challenges for continuous queries. We propose a novel indexing approach model, namely, the Velocity SpatioTemporal ind...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hongwei Zhao, Jiaxin Wu, Danyang Zhang and Pingping Liu
For full description of images? semantic information, image retrieval tasks are increasingly using deep convolution features trained by neural networks. However, to form a compact feature representation, the obtained convolutional features must be furthe...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shunichi Ohmori and Kazuho Yoshimoto
We consider the facility layout problem (FLP) in which we find the arrangements of departments with the smallest material handling cost that can be expressed as the product of distance times flows between departments. It is known that FLP can be formulat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wei Ming Tan and T. Hui Teo
Prognostic techniques attempt to predict the Remaining Useful Life (RUL) of a subsystem or a component. Such techniques often use sensor data which are periodically measured and recorded into a time series data set. Such multivariate data sets form compl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Arseniy Zhogolev and Igor Savin
Most digital soil mapping (DSM) approaches aim at complete statistical model extraction. The value of the explicit rules of soil delineation formulated by soil-mapping experts is often underestimated. These rules can be used for expert testing of the not...
ver más
|
|
|
|
|
|
|
|
|
|
|
Svetlana Korabelshchikova
Pág. 1 - 6
This article presents the result of studying the structure of a set of roots from languages of a special type, namely containing all possible words of length from t1 to t2 (t1 £ t2). The General case of extraction of n-th degree roots from a gi...
ver más
|
|
|
|
|
|