2612 search results - page 124 / 523 » Switching Graphs and Their Complexity |
DAM
2007
14 years 10 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
104
click to vote
ICFCA
2004
Springer
15 years 3 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...