Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Hamming cube
Description:
A Hamming cube is the set of binary strings of a fixed length, viewed as vertices connected or measured by Hamming distance, in combinatorics and theoretical computer science.
Related topics:
Complexity and Algorithms in Graphs (11%),
Limits and Structures in Graph Theory (10%),
Geometric Analysis and Curvature Flows (10%),
Coding theory and cryptography (9%)
OpenAlex ID:
keywords/hamming-cube
Feature Learning based Deep Supervised Hashing with Pairwise Labels
2015
·
Li, Wu-Jun
, Wang, Sheng
, et al.
·
arXiv (Cornell University)
·
740
PDF
Efficient search for approximate nearest neighbor in high dimensional spaces
1998
·
Eyal Kushilevitz
, Rafail Ostrovsky
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
301
PDF
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
2000
·
Eyal Kushilevitz
, Rafail Ostrovsky
, et al.
·
SIAM Journal on Computing
·
290
New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
2005
·
A. Schrijver
·
IEEE Transactions on Information Theory
·
246
PDF
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
2001
·
JEFF KAHN
·
Combinatorics Probability Computing
·
200
Dimension Reduction by Random Hyperplane Tessellations
2013
·
Yaniv Plan
, Roman Vershynin
·
Discrete & Computational Geometry
·
162
PDF
On the solution‐space geometry of random constraint satisfaction problems
2010
·
Dimitris Achlioptas
, Amin Coja‐Oghlan
, et al.
·
Random Structures and Algorithms
·
150
Random subgraphs of finite graphs: I. The scaling window under the triangle condition
2005
·
Christian Borgs
, Jennifer T. Chayes
, et al.
·
Random Structures and Algorithms
·
113
PDF
On Type of Metric Spaces
1986
·
J. Bourgain
, V. Milman
, et al.
·
Transactions of the American Mathematical Society
·
112
PDF
Random subgraphs of finite graphs. II. The lace expansion and the triangle condition
2005
·
Christian Borgs
, Jennifer T. Chayes
, et al.
·
The Annals of Probability
·
102
PDF
Earth Mover Distance over High-Dimensional Spaces
·
Alexandr Andoni
, Piotr Indyk
, et al.
·
86
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
2004
·
A. Chakrabarti
, O. Regev
·
Annual Symposium on Foundations of Computer Science
·
70
On homomorphisms from the Hamming cube to Z
2003
·
David Galvin
·
Israel Journal of Mathematics
·
66
PDF
Polynomial-time approximation schemes for geometric min-sum median clustering
2002
·
Rafail Ostrovsky
, Yuval Rabani
·
Journal of the ACM
·
62
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
1999
·
Amit Chakrabarti
, Bernard Chazelle
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
59
Tighter bounds for nearest neighbor search and related problems in the cell probe model
2000
·
Omer Barkol
, Yuval Rabani
·
ACM Symposium on Theory of Computing (STOC)
·
58
PDF
Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets
2015
·
Oymak, Samet
, Recht, Ben
·
arXiv (Cornell University)
·
50
PDF
KKL, Kruskal--Katona, and Monotone Nets
2013
·
Ryan O'Donnell
, Karl Wimmer
·
SIAM Journal on Computing
·
50
Linear Programming Bounds for Codes via a Covering Argument
2008
·
Michael Navon
, Alex Samorodnitsky
·
Discrete & Computational Geometry
·
39
PDF
KKL, Kruskal-Katona, and Monotone Nets
2009
·
Ryan O'Donnell
, Karl Wimmer
·
Annual Symposium on Foundations of Computer Science
·
38
Range of cube-indexed random walk
2001
·
J. Kahn
·
Israel Journal of Mathematics
·
38
The Terwilliger Algebra of a 2-Homogeneous Bipartite Distance-Regular Graph
2001
·
Brian Curtin
·
Journal of Combinatorial Theory Series B
·
36
PDF
Binary Embedding: Fundamental Limits and Fast Algorithm
2015
·
Yi, Xinyang
, Caramanis, Constantine
, et al.
·
arXiv (Cornell University)
·
34
PDF
Efficient Communication Protocols for Deciding Edit Distance
2012
·
Hossein Jowhari
·
Lecture notes in computer science
·
34
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model
2002
·
Omer Barkol
, Yuval Rabani
·
Journal of Computer and System Sciences
·
32
Show more works
View as search
Works count:
157
Citation count:
3,826
Year
Topic
Type