Zobrazeno 1 - 10
of 56 144
pro vyhledávání: '"Sampson AT"'
Autor:
Mishra, Cyan Subhra, Sampson, Jack, Kandmeir, Mahmut Taylan, Narayanan, Vijaykrishnan, Das, Chita R
There is an increasing demand for intelligent processing on ultra-low-power internet of things (IoT) device. Recent works have shown substantial efficiency boosts by executing inferences directly on the IoT device (node) rather than transmitting data
Externí odkaz:
http://arxiv.org/abs/2408.14379
The deployment of Deep Neural Networks in energy-constrained environments, such as Energy Harvesting Wireless Sensor Networks, presents unique challenges, primarily due to the intermittent nature of power availability. To address these challenges, th
Externí odkaz:
http://arxiv.org/abs/2408.13696
In traditional models of opinion dynamics, each agent in a network has an opinion and changes in opinions arise from pairwise (i.e., dyadic) interactions between agents. However, in many situations, groups of individuals can possess a collective opin
Externí odkaz:
http://arxiv.org/abs/2408.13336
Autor:
Sampson, Corbit R., Restrepo, Juan G.
The spread of disinformation (maliciously spread false information) in online social networks has become an important problem in today's society. Disinformation's spread is facilitated by the fact that individuals often accept false information based
Externí odkaz:
http://arxiv.org/abs/2408.10373
In Spiking Neural Networks (SNNs), learning rules are based on neuron spiking behavior, that is, if and when spikes are generated due to a neuron's membrane potential exceeding that neuron's firing threshold, and this spike timing encodes vital infor
Externí odkaz:
http://arxiv.org/abs/2407.19566
Map matching is a common task when analysing GPS tracks, such as vehicle trajectories. The goal is to match a recorded noisy polygonal curve to a path on the map, usually represented as a geometric graph. The Fr\'echet distance is a commonly used met
Externí odkaz:
http://arxiv.org/abs/2407.19304
One approach to studying the Fr\'echet distance is to consider curves that satisfy realistic assumptions. By now, the most popular realistic assumption for curves is $c$-packedness. Existing algorithms for computing the Fr\'echet distance between $c$
Externí odkaz:
http://arxiv.org/abs/2407.05114
Spanner constructions focus on the initial design of the network. However, networks tend to improve over time. In this paper, we focus on the improvement step. Given a graph and a budget $k$, which $k$ edges do we add to the graph to minimise its dil
Externí odkaz:
http://arxiv.org/abs/2407.04614
We consider the problem of computing an approximate weighted shortest path in a weighted subdivision, with weights assigned from the set $\{0, 1, \infty\}$. We present a data structure $B$, which stores a set of convex, non-overlapping regions. These
Externí odkaz:
http://arxiv.org/abs/2407.01951
Autor:
Sampson, Max, Chan, Kung-Sik
We introduce our method, conformal highest conditional density sets (CHCDS), that forms conformal prediction sets using existing estimated conditional highest density predictive regions. We prove the validity of the method and that conformal adjustme
Externí odkaz:
http://arxiv.org/abs/2406.18052