Sciweavers

3218 search results - page 354 / 644
» Timed Extensions for SDL
Sort
View
TJS
2002
83views more  TJS 2002»
15 years 6 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
TSMC
2002
110views more  TSMC 2002»
15 years 6 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
CONCURRENCY
2008
82views more  CONCURRENCY 2008»
15 years 5 months ago
Segregation and scheduling for P2P applications with the interceptor middleware system
Very large size Peer-to-Peer systems are often required to implement efficient and scalable services, but usually they can be built only by assembling resources contributed by man...
Cosimo Anglano
IJHPCA
2010
113views more  IJHPCA 2010»
15 years 5 months ago
Accurate Heterogeneous Communication Models and a Software Tool for Their Efficient Estimation
In this paper, we analyze restrictions of traditional communication performance models affecting the accuracy of analytical prediction of the execution time of collective communic...
Alexey L. Lastovetsky, Vladimir Rychkov, Maureen O...
INFOCOM
2010
IEEE
15 years 5 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz