13603 search results - page 328 / 2721 » On the Computational Complexity of Cut-Reduction |
215
click to vote
STACS
2009
Springer
16 years 2 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
206
Voted
IWPEC
2009
Springer
16 years 2 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
187
Voted
COMPLEX
2009
Springer
16 years 2 months ago
2009
Springer
This paper recognises that comparisons have been made between the role of the conductor of an orchestra and leaders of enterprises, but that little note has been taken of how the c...
202
click to vote
DCC
2004
IEEE
16 years 7 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
227
Voted
PRDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...