2373 search results - page 215 / 475 » Complexities for generalized models of self-assembly |
158
click to vote
ASIACRYPT
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di�...
158
click to vote
HCW
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
149
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
165
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
434
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...