piskvorky/sim-shootout
Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neighbours-intro (⭐ 98)
Code for "Performance shootout between nearest-neighbour libraries": http://radimrehurek.com/2013/11/performance-shootout-of-nearest-neighbours-intro (⭐ 98)
Writing this at 6am. I live in a small one bed apartment which I bought myself. I'm from a city with a severe housing crisis so I'm constantly told how impressive it is to have bought a place by mysel...
We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also selected....
Points: 197 | Comments: 315 | Author: Amorymeltzer
K Nearest Neighbours (⭐ 27)
...
Natural Neighbours interpolation (⭐ 57)
...
In the Sznajd model of 2000, a pair of neighbouring agents on a square lattice convinces its six neighbours of the pair opinion if and only if the two agents of the pair share the same opinion. It differs from other consensus models of sociophysics...
In the consensus model of Sznajd, opinions are integers and a randomly chosen pair of neighbouring agents with the same opinion forces all their neighbours to share that opinion. We propose a simple extension of the model to continuous opinions, ba...
Thursday is the day after Wednesday and before Friday. On Thursday my neighbours invited me for a drink.
A set $S$ of vertices of a graph is a defensive alliance if, for each element of $S$, the majority of its neighbours is in $S$. We consider the notion of local minimality in this paper. We are interested in locally minimal defensive alliance of maxim...
A set $S$ of vertices of a graph is a defensive alliance if, for each element of $S$, the majority of its neighbours are in $S$. We study the parameterized complexity of the Defensive Alliance problem, where the aim is to find a minimum size defensiv...
The Universal Similarity Metric (USM) has been demonstrated to give practically useful measures of "similarity" between sequence data. Here we have used the USM as an alternative distance metric in a K-Nearest Neighbours (K-NN) learner to allow effec...
Spain appears in light pollution maps as a country less polluted than their neighbours in the European Union. This seems to be an illusion due to its low population density. The data indicate that Spain is one of the most contaminated countries. To...
We propose a data structure in $d$-dimensional hyperbolic space that can be considered a natural counterpart to quadtrees in Euclidean spaces. Based on this data structure we propose a so-called L-order for hyperbolic point sets, which is an extensio...
I’ve been living alone in a flat for a few years. However, in January, I suffered an extreme mental breakdown and almost died - since then I have been agoraphobic. A good friend of mine who lives ne...
We combine the metrics of distance and isolation to develop the Analytic Isolation and Distance-based Anomaly (AIDA) detection algorithm. AIDA is the first distance-based method that does not rely on the concept of nearest-neighbours, making it a par...
supplies at Kutupalong makeshift refugee camp. Hasina (21) witness the murder of more than 50 neighbours by the Myanmar Army, experienced extensive torture
Terence J. Donovan (not to be mistaken for the iconic swinging sixties fashion photographer Terence Donovan) is an Anglo-Australian actor, popular for his roles in the Aussie soaps Neighbours (1985) …