Sciweavers

74 search results - page 2 / 15
» The communication complexity of the Hamming distance problem
Sort
View
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 2 days ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
13 years 10 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
TKDE
2002
133views more  TKDE 2002»
13 years 5 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
CORR
2004
Springer
114views Education» more  CORR 2004»
13 years 5 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
ECCC
2006
99views more  ECCC 2006»
13 years 5 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu