2060 search results - page 350 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
EDOC
2007
IEEE
15 years 4 months ago
2007
IEEE
Models have been used in various engineering fields to help managing complexity and represent information in difbstraction levels, according to specific notations and stakeholde...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
SLIP
2004
ACM
15 years 3 months ago
2004
ACM
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...