471 search results - page 19 / 95 » Computational complexity: a conceptual perspective |
SIGCOMM
1998
ACM
13 years 12 months ago
1998
ACM
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
JACM
2002
13 years 7 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
JSA
2006
13 years 7 months ago
2006
Nowadays, organizations face with a very high competitiveness and for this reason they have to continuously improve their processes. Two key aspects to be considered in the softwa...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— Moments are generic (and usually intuitive) descriptors that can be computed from several kinds of objects defined either from closed contours or from a set of points. In this...
NAR
2011
12 years 10 months ago
2011
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...