1941 search results - page 98 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
TIT
2002
14 years 9 months ago
2002
We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to success...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...