|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
Daniel Yang, Arya Goutam, Kevin Ji and TJ Tsai
This paper studies the problem of identifying piano music in various modalities using a single, unified approach called marketplace fingerprinting. The key defining characteristic of marketplace fingerprinting is choice: we consider a broad range of fing...
ver más
|
|
|
|
|
|
|
|
|
Lan Huang, Yuanwei Zhao, Bo Wang, Dongxu Zhang, Rui Zhang, Subhashis Das, Simone Bocca and Fausto Giunchiglia
Knowledge graph-based data integration is a practical methodology for heterogeneous legacy database-integrated service construction. However, it is neither efficient nor economical to build a new cross-domain knowledge graph on top of the schemas of each...
ver más
|
|
|
|
|
|
|
|
|
Zhihui Du, Oliver Alvarado Rodriguez, Joseph Patchett and David A. Bader
Data from emerging applications, such as cybersecurity and social networking, can be abstracted as graphs whose edges are updated sequentially in the form of a stream. The challenging problem of interactive graph stream analytics is the quick response of...
ver más
|
|
|
|
|
|
|
|
|
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportio...
ver más
|
|
|
|