747 search results - page 149 / 150 » Theory and Construction of Molecular Computers |
IPL
2007
14 years 9 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
115
Voted
TIFS
2008
14 years 9 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
JCT
2000
14 years 9 months ago
2000
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
101
click to vote
UMUAI
1998
14 years 9 months ago
1998
We have implemented an application-independent collaboration manager, called Collagen, based on the SharedPlan theory of discourse, and used it to build a software interface agent...
ENTCS
2008
14 years 9 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...