The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
Large-scale scientific computing applications frequently make use of closely-coupled distributed parallel components. The performance of such scientific applications is therefore ...
Lei Zhao, Stephen A. Jarvis, Daniel P. Spooner, Gr...
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...
Many Knowledge workers are increasingly using online resources to find out latest developments in their specialty and articles of interest. To extract relevant information from s...
For the composition of Web services non-functional characteristics are commonly considered criteria for finding and selecting available services. Our work focuses on a mechanism ...
Michael C. Jaeger, Gregor Rojec-Goldmann, Gero M&u...