-
When usign motmetrics.utils.compare_to_groundtruth() function with dist='euc', the distance metric is configured to the squared euclidean distance (norm2squared_matrix).
As a consequence, the distanc…
-
This new feature is used for layout method in Qiskit (also called "qubit mapping problem").
### Ideas
1. Build a distance matrix that takes not only hardware topology, but also calibration data …
-
I would be interested in being able to do something like this:
```Julia
using GridGraphs
using DifferentiationInterface
using Zygote
function objective(permeability)
grid = GridGraph(p…
-
As the author put it, this algorithm is much faster. For a randomly generated 3000x3000 cost matrix, it'll take a fraction of seconds to solve.
```
N_a = 3000
N_b = 3000
# Random costs
dist_mat…
-
Over in #3778 I realized that the reverse tree of the BSS matrix is significantly off compared to the unidirectional AStar BSS algo. In my mind both should yield the same time/distance, unless they're…
-
## Problem
When I passed the `avoid` parameters in the `distance_matrix` method, it told me that it is an invalid restriction. However, I wonder if it's possible to allow multiple avoid options like …
-
When using time distance matrix, won't it be good to use OpenMP to boost the performance?
For example, a 1000*1000 matrix calculation, with 10 core CPU, we can spawn 10 thread and parallel compute 1…
-
Dear Prof Shrikanth,
I am faced with a problem that requires the production of a very large distance matrix (6.9 gB) and I wish to create a hierarchical clustering using the Ward method.
So far…
JimTD updated
5 months ago
-
ESBMC 7.3.0 crashes on the following small C program:
command : ` esbmc FormAI_25698.c`
```c
//FormAI DATASET v1.0 Category: Levenshtein Distance Calculator ; Style: Ada Lovelace
#include
#in…
-
Hi, I trained Market1501 with resnet50 AlignedReID, but the final result is only 87.9% rank-1 / 72.0% mAP (without re-ranking), 89.3% rank-1 / 85.4% mAP (with re-ranking), which is **far from** what i…