2489 search results - page 113 / 498 » On the Subgroup Distance Problem |
150
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
151
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
112
click to vote
SCALESPACE
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we address the problem of partial comparison of non-rigid objects. We introduce a new class of set-valued distances, related to the concept of Pareto optimality in e...
151
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
126
click to vote
TIT
2008
15 years 3 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...