Νέα

HAR.S.H. presentations given to attending students in primary and secondary education at Researcher's Night and at Researcher Night's Chatlab

HAR.S.H. team will participate in Researcher Night's Chatlab to talk about our work to young students.

HAR.S.H. team will participate in Researcher's Night to talk about similarity search and retrieval and zero-shot classification.

Computer Science Department - University of Crete, Classes of '85/'95/'05 reunion.

"The LAW theorem: Local Reads and Linearizable Asynchronous Replication"

"The LAW theorem: Local Reads and Linearizable Asynchronous Replication"

"Advances in Time-Series Anomaly Detection: Algorithms, Benchmarks, and Evaluation Measures"

"Advances in Time-Series Anomaly Detection: Algorithms, Benchmarks, and Evaluation Measures"

"Lock-Free Augmented Trees (Abstract)"

"Concurrent Double-Ended Priority Queues"

"Concurrent Binary Search Trees Supporting Split and Join"

"When is Recoverable Consensus harder than Consensus?"

HARSH: Hardware-Aware extReme-scale Similarity search

Κωδικός Έργου: ΥΠ3ΤΑ-0560901
Ημερομηνία Έναρξης Έργου: 15 Απριλίου 2025
Ημερομηνία Λήξης Έργου: 30 Ιουνίου 2026
Διαχειριστική Αρχή: Επιτελική Δομή ΕΣΠΑ Τομέα Παιδείας του Υπουργείου Παιδείας και Θρησκευμάτων, ΕΛΛΑΔΑ 2.0, ΕΘΝΙΚΟ ΣΧΕΔΙΟ ΑΝΑΚΑΜΨΗΣ και ΑΝΘΕΚΤΙΚΟΤΗΤΑΣ
Συντονιστής Σύμπραξης: Πανεπιστήμιο Κρήτης (ΠΚ), Τμήμα Επιστήμης Υπολογιστών