466 search results - page 21 / 94 » Fundamental Complexity of Optical Systems |
130
click to vote
COCO
2009
Springer
15 years 12 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
161
click to vote
COMPSAC
2002
IEEE
15 years 10 months ago
2002
IEEE
Quality is a fundamental concept in software and information system development. It is also a complex and elusive concept. A large number of quality models have been developed for...
133
click to vote
DATE
2010
IEEE
15 years 10 months ago
2010
IEEE
—Recent developments have shown the possibility of leveraging silicon nanophotonic technologies for chip-scale interconnection fabrics that deliver high bandwidth and power effi...
147
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
160
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...