1523 search results - page 27 / 305 » The Computational Complexity of Linear Optics |
WG
2010
Springer
13 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
FGCS
2007
13 years 7 months ago
2007
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
This paper presents the applicability of a cosimulation methodology based on an object-oriented simulation environment, to multi-domain and multi-language systems design. This met...
CCGRID
2005
IEEE
14 years 1 months ago
2005
IEEE
The scheme of advance reservations in dynamically provisioned optical networks is novel, and there are no gridbased applications designed to utilize this scheme. We formally defi...