Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
nearest neighbor search
biblio
Discrete Locally-Linear Preserving Hashing
Submitted by grigby1 on Fri, 06/12/2020 - 11:09am
locally linear preserving
unsupervised methods
Unsupervised Learning
unsupervised hashing method
unsupervised hashing algorithms
unsupervised hashing
search problems
Resiliency
resilience
pubcrawl
nearest neighbour methods
nearest neighbor search
matrix algebra
locally linear structure
anchor embedding
local weight estimation
local anchor embedding algorithm
image retrieval
Image coding
hash algorithms
graph theory
discrete locally-linear preserving hashing
discrete hashing
Compositionality
Binary codes
approximate adjacent matrix
anchor graph construction algorithm
biblio
Supervised Max Hashing for Similarity Image Retrieval
Submitted by grigby1 on Fri, 06/12/2020 - 11:08am
resilience
hashing
image retrieval
k-ary base
labeled image datasets
learning (artificial intelligence)
mathematically differentiable approximation
nearest neighbor search
pubcrawl
Quantization (signal)
Hash functions
Resiliency
rich feature vectors
Semantics
similarity image retrieval
storage efficiency
supervised hashing methods
supervised max hashing
Training
feature vector generation
-Learning-to-Hash
-Winner-Take-All-Hash-Family
Approximation algorithms
argmax function
Compositionality
convolutional neural nets
convolutional neural networks
deep neural network architecture
feature extraction
-Convolutional-Neural-Networks
file organisation
gradient descent methods
gradient methods
hand-crafted feature vectors
hash algorithm
hash algorithms
hash code
Hash Function
biblio
Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket
Submitted by aekwall on Mon, 06/08/2020 - 10:33am
locality-sensitive hashing algorithm
tree searching
tree search method
space complexity
Sorting
Resiliency
query processing
pubcrawl
Pattern recognition
NNS
nearest neighbour methods
nearest neighbor search
nearest neighbor query
machine learning
C2LSH
locality sensitive hashing
Image detection
Heapsort
heap sort of hash bucket algorithm
hash table
Hash functions
hash algorithms
file organisation
data sorting
Cryptography
computational complexity
Compositionality
biblio
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Submitted by grigby1 on Fri, 05/22/2020 - 1:39pm
parallel processing
faster query execution
high memory footprint
in-memory indexes
K-NN search
MatDot codes
matrix multiplication
model parallelism
model-parallel architecture
MRPT
multiple random projection trees
nearest neighbor estimation
fast k-nearest neighbors
query response time
query time
single compute node
single processing node
storage constraints
storage-optimal MatDot Codes
storage-optimal recovery threshold
straggler and failure tolerance
straggler-prone environment
Systematics
worker nodes
nearest neighbor search
Indexes
Data models
Computational modeling
Big Data
trees (mathematics)
Metrics
Measurement
nearest neighbour methods
data storage
query processing
mathematics computing
pubcrawl
high-dimensional data
Approximation algorithms
approximate nearest neighbor algorithms
candidate points
coded computing
coded matrix multiplication
computation efforts
computation strategy
distributed computing cluster
distributed processing
Euclidean distance calculations
biblio
Parallel Implementation of K-Nearest-Neighbors for Face Recognition
Submitted by grigby1 on Fri, 05/22/2020 - 1:39pm
graphics processing units
Time complexity
parallel CUDA implementation
parallel architectures
KNN classifier
k-nearest-neighbours classifier
Instruction sets
countless classification algorithms
nearest neighbor search
Sorting
pubcrawl
image classification
face recognition
nearest neighbour methods
Measurement
Metrics
Classification algorithms
pattern classification
Indexes
biblio
Asymptotically Optimal Pruning for Nonholonomic Nearest-Neighbor Search
Submitted by grigby1 on Fri, 05/22/2020 - 1:39pm
distance evaluations
tree searching
set theory
sampling-based motion planning algorithms
pruning techniques
Path Planning
optimal pruning
nonholonomic constraints
k-d tree algorithm
geodesic distance
explicit distance comparisons
exact Nearest-Neighbor Search
pubcrawl
differential geometry
computationally demanding task
asymptotic properties
asymptotic computational bottleneck
nearest neighbor search
search problems
computational complexity
nearest neighbour methods
Measurement
Metrics
mobile robots
biblio
K-nearest Neighbor Search by Random Projection Forests
Submitted by grigby1 on Fri, 05/22/2020 - 1:38pm
Clustering algorithms
Vegetation
tree-based methodology
rpForests
random projection forests
multicore computers
kNN search
kNN distances
exponential decay
ensemble size
ensemble random projection trees
ensemble methods
Ensemble
clustered computers
nearest neighbor search
k-nearest neighbor search
learning (artificial intelligence)
search problems
computational complexity
k-nearest neighbors
nearest neighbour methods
Measurement
Metrics
Big Data
random forests
pubcrawl
Unsupervised Learning
Forestry
Data mining
machine learning algorithms
machine learning
biblio
On Integrating Knowledge Graph Embedding into SPARQL Query Processing
Submitted by grigby1 on Fri, 05/22/2020 - 1:38pm
Approximation algorithms
Time factors
SPARQL query processing
research problems
query languages
query language
NN search algorithm
Nearest Neighbor Searching
knowledge graph embedding
KGE
Covariance matrices
search problems
nearest neighbor search
query processing
graph theory
nearest neighbour methods
Measurement
optimisation
Metrics
standards
Mathematical model
pubcrawl
biblio
Stacked K-Means Hashing Quantization for Nearest Neighbor Search
Submitted by grigby1 on Fri, 05/22/2020 - 1:38pm
hypercube increases
target data
stacked k-means hashing quantization
SKMH
similar approximation ability
optimizing time
multilayer lower-dimensional cubes
mentioned optimizing process
KMH method
KMH divides
K-means Hashing
k-means
information available online
improved hashing method
pubcrawl
higher-dimensional cubes
High-dimensional Vectors
fast nearest neighbor search
codes data
binary code optimizing
high dimensional data
low-dimensional subspaces
nearest neighbor search
search problems
Measurement
optimisation
Metrics
biblio
A Nearest Neighbor Search Engine Using Distance-Based Hashing
Submitted by grigby1 on Fri, 05/22/2020 - 1:38pm
query processing
query point
high-dimensional data
hardware search engine
FPGA-based nearest neighbor search engine
flexible distance-based hashing
distance based hashing
nearest neighbor search algorithm
nearest neighbor search
file organisation
pubcrawl
search problems
search engines
nearest neighbour methods
Measurement
Metrics
parallel processing
field programmable gate arrays
FPGA
« first
‹ previous
1
2
3
4
5
6
7
next ›
last »
