|
|
|
Youngki Park and Youhyun Shin
This paper presents a novel approach for finding the most semantically similar conversational sentences in Korean and English. Our method involves training separate embedding models for each language and using a hybrid algorithm that selects the appropri...
ver más
|
|
|
|
|
|
|
Ding Li, Wenzhong Li, Guoqiang Zhang, Yizhou Chen, Xu Zhong, Mingkai Lin and Sanglu Lu
In many applications, data streams are indispensable to describe the relationships between nodes in networks, such as social networks, computer networks, and hyperlink networks. Fundamentally, a graph stream is a dynamic representation of a graph, which ...
ver más
|
|
|
|
|
|
|
Laura Plaza, Lourdes Araujo, Fernando López-Ostenero and Juan Martínez-Romo
Online learning is quickly becoming a popular choice instead of traditional education. One of its key advantages lies in the flexibility it offers, allowing individuals to tailor their learning experiences to their unique schedules and commitments. Moreo...
ver más
|
|
|
|
|
|
|
Karima Khettabi, Zineddine Kouahla, Brahim Farou, Hamid Seridi and Mohamed Amine Ferrag
Internet of Things (IoT) systems include many smart devices that continuously generate massive spatio-temporal data, which can be difficult to process. These continuous data streams need to be stored smartly so that query searches are efficient. In this ...
ver más
|
|
|
|
|
|
|
Hyung-Ju Cho
Given a set of facilities F and a query point q, a k-farthest neighbor (kFN) query returns the k farthest facilities f1,f1,⋯,fk" role="presentation">??1,??1,?,????f1,f1,?,fk
f
1
,
f
1
,
?
,
f
k
from q. This study considers the moving k-farthe...
ver más
|
|
|
|
|
|
|
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang and Yang Zhong
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd?Warsh...
ver más
|
|
|
|
|
|
|
Szabolcs Kocsis Szürke, Gergo Sütheö, Antal Apagyi, István Lakatos and Szabolcs Fischer
Vehicle safety risk can be decreased by diagnosing the lithium-ion battery system of electric road vehicles. Real-time cell diagnostics can avoid unexpected occurrences. However, lithium-ion batteries in electric vehicles can significantly differ in desi...
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
|
|
|
|
|
|
|
Panagiotis Moutafis, George Mavrommatis, Michael Vassilakopoulos and Antonio Corral
Aiming at the problem of spatial query processing in distributed computing systems, the design and implementation of new distributed spatial query algorithms is a current challenge. Apache Spark is a memory-based framework suitable for real-time and batc...
ver más
|
|
|
|
|
|
|
Oscar Rojas, Veronica Gil-Costa and Mauricio Marin
Web search engines are built from components capable of processing large amounts of user queries per second in a distributed way. Among them, the index service computes the top-k documents that best match each incoming query by means of a document rankin...
ver más
|
|
|
|