Results 41 to 50 of about 3,964 (242)
Robust Single-Sample Face Recognition by Sparsity-Driven Sub-Dictionary Learning Using Deep Features
Face recognition using a single reference image per subject is challenging, above all when referring to a large gallery of subjects. Furthermore, the problem hardness seriously increases when the images are acquired in unconstrained conditions.
Vittorio Cuculo +4 more
doaj +1 more source
Abstract This review analyzed 241 scholarly articles published between 2010 and 2025 in information science venues to examine how affect shapes refugees' information behavior during forced migration and to identify additional contextual factors. It identifies seven affective dimensions: anxiety, shame and stigma, grief and loss, frustration, (mis)trust,
Maja Krtalić, Lilach Alon
wiley +1 more source
The Parameterized Hardness of the Art Gallery Problem.
23 pages, 12 figures.
Bonnet, Édouard, Miltzow, Till
openaire +4 more sources
Deep Group-Shuffling Dual Random Walks With Label Smoothing for Person Reidentification
Person reidentification (ReID) is a challenging task of finding a target pedestrian in a gallery set collected from multiple nonoverlapping camera views.
Ruopei Guo +3 more
doaj +1 more source
Abstract This paper explores the growing influence of young people's activism in UK museums and its educational implications. It draws on a five‐year collaborative programme (2019–2023) with young people of colour (16–28) in a university museum setting, focusing on a Young Collective established to address cultural inequalities.
Sadia Habib
wiley +1 more source
The article is devoted to the fate of the intellectuals who came over to the Soviet power and participated in the revolutionary process. The analysis is carried out on the example of the life and work of artist Alexei Rybnikov (1887-1949), who came from ...
Galina V Aksenova
doaj +1 more source
Complexity of the General Chromatic Art Gallery Problem
In the original Art Gallery Problem (AGP), one seeks the minimum number of guards required to cover a polygon $P$. We consider the Chromatic AGP (CAGP), where the guards are colored. As long as $P$ is completely covered, the number of guards does not matter, but guards with overlapping visibility regions must have different colors.
Sándor P. Fekete +2 more
openaire +2 more sources
Implementation of polygon guarding algorithms for art gallery problems
12 pages, 15 ...
Shiva Maleki, Ali Mohades
openaire +2 more sources
Abstract With growing attention to student agency in academic and policy discourse, international education has become a prominent context for examining how students navigate new cultural, academic, linguistic and social environments. However, much of this discussion attributes student agency to the ‘international’ aspect, while overlooking the ...
Soyoung Lee
wiley +1 more source
Abstract As England embarks on its first comprehensive curriculum review in fifteen years, this paper offers critical insights from schools that sustained arts‐rich provision despite a policy landscape hostile to creative subjects. Drawing on data from the Researching Arts‐rich Primary Schools (RAPS) project—a mixed‐methods study of 76 arts‐rich ...
Pat Thomson, Christine Hall
wiley +1 more source

