A new model for the linear 1-dimensional online clustering problem

DOI10.1515/ausi-2015-0001zbMath1319.68180OpenAlexW2269088076MaRDI QIDQ2254541

Tamás Németh, Áron Pelyhe, András London, Jozsef Nemeth

Publication date: 5 February 2015

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ausi-2015-0001

zbMATH Keywords

learning algorithmsonline algorithmsdata clusteringreal-time locating systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online data clustering algorithms in an RTLS system
• Online facility location with facility movements
• Online algorithms. The state of the art
• Online clustering with variable sized clusters
• Online Clustering on the Line with Square Cost Variable Sized Clusters
• Parameter learning algorithm for the online data acknowledgment problem
• On-line analysis of the TCP acknowledgment delay problem
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
• On the Online Unit Clustering Problem
• A Randomized Algorithm for Online Unit Clustering
• Dynamic TCP Acknowledgment: Penalizing Long Delays

This page was built for publication: A new model for the linear 1-dimensional online clustering problem