Jani SUBAN in Nilukshan KRISHNARAM

☰ Meni

V ponedeljek, 7. septembra 2026, bodo ob 16:00 uri izvedeni dve 
predavanji v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.

ČAS/PROSTOR: 7. september 2026 ob 16.00 prek Zoom-a.

1. predavanje:
============

————————————
PREDAVATELJ: Jani SUBAN
————————————

Jani Suban is a first-year PhD student and teaching assistant at UP FAMNIT and UL FRI. His research field is algorithms and data structures, with a focus on algorithms on strings.

—————————————————————————————————-
NASLOV: Knight-merge: string concatenation becomes suffix tree merging
—————————————————————————————————-

POVZETEK:

Suffix trees are a widely used data structure for text indexing and pattern searching. A suffix tree is a path-compressed trie constructed from all suffixes of the input text. Its construction can be performed in linear time with respect to the length of the input text. This raises a new question: can we merge two suffix trees in linear time?
We present a new algorithm, called Knight-merge, for merging two suffix trees into a single suffix tree. The algorithm runs in linear time, $O(n_1 + n_2)$, where $n_1$ and $n_2$ are the lengths of the two strings from which the suffix trees were constructed. It reuses the existing suffix trees and adds new nodes only when necessary. The algorithm preserves and computes suffix links, and it improves the time complexity of merging two suffix trees from $O((n_1 + n_2)^2)$ to $O(n_1 + n_2)$.

Seminar bo potekal v angleškem jeziku.

=============================================================================================================

2. predavanje:
============

—————————————————–
PREDAVATELJ: Nilukshan KRISHNARAM
—————————————————–

Nilukshan Krishnaram is a PhD student and teaching assistant at UP FAMNIT, where he is affiliated with the HICUP Lab. He holds a B.Sc. (Hons) in Information Systems from the University of Colombo, Sri Lanka. His research interests focus on human–computer interaction, extended reality, user experience design, and visual and perceptual attention guidance.

————————————————————————————————————————————
NASLOV: Look Here! But Did It Help? What Eye Tracking Reveals About Visual Attention Guidance
————————————————————————————————————————————

POVZETEK:

Visual attention-guidance techniques are designed to help users find what matters. But, does a cue that grabs attention actually help users look in the right place? To investigate this question, we conducted an exploratory user study comparing paper-informed replications of 18 existing attention-guidance techniques within the same controlled visual-search task. Twelve participants completed 76 adaptive pairwise comparisons of these techniques while we collected subjective judgments alongside eye-tracking data, examining noticeability, preference, perceived findability, target-fixation success, guidance-relative time to first fixation, and replay effort. The results reveal that these measures tell very different stories: highly noticeable techniques were not necessarily the fastest or most reliable at guiding gaze, the most preferred techniques were not always the strongest performers, and some less-preferred techniques still achieved high search success. The findings show that no single measure can fully capture how well an attention-guidance technique works, highlighting the importance of considering both subjective judgments and gaze-based performance.

Seminar bo potekal v angleškem jeziku.

=============================================================================================================

Seminarja bosta potekala online prek aplikacije Zoom s pričetkom ob 16:00 uri na sledeči povezavi:

https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09

Meeting ID: 297 328 207
Passcode: 123456789

Vabljeni!