-
junit-3.8.2-6.4.fc12.x86_64
JUnit is a regression testing framework written by Erich Gamma and Kent
Beck. It is used by the developer who implements unit tests in Java.
JUnit is Open Source Software, released under the IBM Public License and
hosted on SourceForge.
Located in
LBN
/
…
/
Access and Identity Management
/
BastionLinux 13
-
junit-4.10-5.lbn13.noarch
JUnit is a regression testing framework written by Erich Gamma and Kent Beck.
It is used by the developer who implements unit tests in Java. JUnit is Open
Source Software, released under the Common Public License Version 1.0 and
JUnit is Open Source Software, released under the IBM Public License and
hosted on SourceForge.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 13
-
junit-4.12-2.lbn19.noarch
JUnit is a regression testing framework written by Erich Gamma and Kent Beck.
It is used by the developer who implements unit tests in Java. JUnit is Open
Source Software, released under the Common Public License Version 1.0 and
hosted on GitHub.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 19
-
junit-4.12-11.lbn25.noarch
JUnit is a regression testing framework written by Erich Gamma and Kent Beck.
It is used by the developer who implements unit tests in Java. JUnit is Open
Source Software, released under the Common Public License Version 1.0 and
hosted on GitHub.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 25
-
junit4-4.6-1.fc13.x86_64
JUnit is a regression testing framework written by Erich Gamma and Kent Beck.
It is used by the developer who implements unit tests in Java. JUnit is Open
Source Software, released under the Common Public License Version 1.0 and
JUnit is Open Source Software, released under the IBM Public License and
hosted on SourceForge.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 13
-
jvector-3.0.6-1.lbn36.noarch
Exact nearest neighbor search (k-nearest-neighbor or KNN) is prohibitively expensive at higher dimensions, because approaches to segment the search space that work in 2D or 3D like quadtree or k-d tree devolve to linear scans at higher dimensions. This is one aspect of what is called “the curse of dimensionality.”
With larger datasets, it is almost always more useful to get an approximate answer in logarithmic time, than the exact answer in linear time. This is abbreviated as ANN (approximate nearest neighbor) search.
There are two broad categories of ANN index:
Partition-based indexes, like LSH or IVF or SCANN
Graph indexes, like HNSW or DiskANN
Graph-based indexes tend to be simpler to implement and faster, but more importantly they can be constructed and updated incrementally. This makes them a much better fit for a general-purpose index than partitioning approaches that only work on static datasets that are completely specified up front. That is why all the major commercial vector indexes use graph approaches.
JVector is a graph index in the DiskANN family tree.
Located in
LBN
/
…
/
Data Science
/
BastionLinux 36
-
jvnet-parent-4-7.fc24.noarch
Java.net parent POM file used by most Java.net subprojects such as
Glassfish
Located in
LBN
/
…
/
Zenoss 4
/
BastionLinux 25
-
jvnet-parent-4-7.lbn19.noarch
Java.net parent POM file used by most Java.net subprojects such as
Glassfish
Located in
LBN
/
…
/
Zenoss 4
/
BastionLinux 19
-
jwhois-4.0-19.fc13.x86_64
A whois client that accepts both traditional and finger-style queries.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 13
-
jwhois-4.0-30.fc18.1302261002kf.armv6hl
A whois client that accepts both traditional and finger-style queries.
Located in
LBN
/
…
/
Core Linux
/
BastionLinux 13
