13621 search results - page 381 / 2725 » Computability and Complexity in Self-assembly |
166
click to vote
CRYPTO
2000
Springer
16 years 15 hour ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
171
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
342
click to vote
ICANN
2011
Springer
14 years 11 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
254
click to vote
JMLR
2012
13 years 10 months ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
272
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...