151 search results - page 4 / 31 » A Nonuniform Algorithm for the Hidden Number Problem in Subg... |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
TSP
2008
13 years 7 months ago
2008
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
CAINE
2003
13 years 9 months ago
2003
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...