3946 search results - page 121 / 790 » The computational complexity of choice sets |
179
click to vote
JOC
2000
15 years 6 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
159
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
132
click to vote
TCS
2010
15 years 4 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
218
click to vote
PAMI
2010
15 years 1 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
202
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of s...