Sunil Prabhakar - Academia.edu (original) (raw)
Uploads
Papers by Sunil Prabhakar
IEEE Conference on Mass Storage Systems and Technologies, Mar 15, 1999
VLDB '02: Proceedings of the 28th International Conference on Very Large Databases, 2002
Lecture Notes in Computer Science, 2004
Lecture Notes in Computer Science, 2003
International Symposium on Information Technology, 2003
Remote access to distributed hyperlinked information proves to be one of the killer applications ... more Remote access to distributed hyperlinked information proves to be one of the killer applications for computer networks. More and more content in current inter and intranets is available as hyperdata, a form easing its distribution and semantic organization. In the framework of the Internet's Web-portals and pay-sites, mechanisms for login based on username and password enable the dynamic customization as
Lecture Notes in Computer Science
An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i... more An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i e the amount of data that a certain algorithm can "hide" until reaching allowable distortion limits One fundamental difference between watermarking [4] [5] [7] [8] [9] [13] [14] [17] [18] [19] [20] [21] [22] [23] and generic data hiding resides exactly in the main applicability and descriptions of the two domains Data hiding aims at enabling Alice and Bob
Journal of Hydrologic Engineering, 2009
International Journal of Image and Graphics, 2003
Multimedia data poses challenges for efficient storage and retrieval due to its large size and pl... more Multimedia data poses challenges for efficient storage and retrieval due to its large size and playback timing requirements. For applications that store very large volumes of multimedia data, hierarchical storage offers a scalable and economical alternative to store data on magnetic disks. In a hierarchical storage architecture data is stored on a tape or optical disk based tertiary storage layer with the secondary storage disks serving as a cache or buffer. Due to the need for swapping media on drives, retrieving multimedia data from tertiary storage can potentially result in large delays before playback (startup latency) begins as well as during playback (jitter). In this paper we address the important problem of reducing startup latency and jitter for very large multimedia repositories. We propose that secondary storage should not be used as a cache in the traditional manner — instead, most of the secondary storage should be used to permanently store partial objects. Furthermore,...
IEEE Transactions on Knowledge and Data Engineering, 2006
BMC Systems Biology, 2008
NASA CONFERENCE PUBLICATION, 2002
We also show that our schemes can easily adapt to variations in the access pattern. This also all... more We also show that our schemes can easily adapt to variations in the access pattern. This also allows the schemes to be employed when no prior information about the access pattern is available. Interestingly, our results show that the probabilities of object access do not ...
Very Large Data Bases, Sep 1, 2006
22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)
Lecture Notes in Computer Science, 2005
2007 IEEE 23rd International Conference on Data Engineering, 2007
IEEE Conference on Mass Storage Systems and Technologies, Mar 15, 1999
VLDB '02: Proceedings of the 28th International Conference on Very Large Databases, 2002
Lecture Notes in Computer Science, 2004
Lecture Notes in Computer Science, 2003
International Symposium on Information Technology, 2003
Remote access to distributed hyperlinked information proves to be one of the killer applications ... more Remote access to distributed hyperlinked information proves to be one of the killer applications for computer networks. More and more content in current inter and intranets is available as hyperdata, a form easing its distribution and semantic organization. In the framework of the Internet's Web-portals and pay-sites, mechanisms for login based on username and password enable the dynamic customization as
Lecture Notes in Computer Science
An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i... more An important parameter in evaluating data hiding methods is hiding capacity [3] [11] [12], [16] i e the amount of data that a certain algorithm can "hide" until reaching allowable distortion limits One fundamental difference between watermarking [4] [5] [7] [8] [9] [13] [14] [17] [18] [19] [20] [21] [22] [23] and generic data hiding resides exactly in the main applicability and descriptions of the two domains Data hiding aims at enabling Alice and Bob
Journal of Hydrologic Engineering, 2009
International Journal of Image and Graphics, 2003
Multimedia data poses challenges for efficient storage and retrieval due to its large size and pl... more Multimedia data poses challenges for efficient storage and retrieval due to its large size and playback timing requirements. For applications that store very large volumes of multimedia data, hierarchical storage offers a scalable and economical alternative to store data on magnetic disks. In a hierarchical storage architecture data is stored on a tape or optical disk based tertiary storage layer with the secondary storage disks serving as a cache or buffer. Due to the need for swapping media on drives, retrieving multimedia data from tertiary storage can potentially result in large delays before playback (startup latency) begins as well as during playback (jitter). In this paper we address the important problem of reducing startup latency and jitter for very large multimedia repositories. We propose that secondary storage should not be used as a cache in the traditional manner — instead, most of the secondary storage should be used to permanently store partial objects. Furthermore,...
IEEE Transactions on Knowledge and Data Engineering, 2006
BMC Systems Biology, 2008
NASA CONFERENCE PUBLICATION, 2002
We also show that our schemes can easily adapt to variations in the access pattern. This also all... more We also show that our schemes can easily adapt to variations in the access pattern. This also allows the schemes to be employed when no prior information about the access pattern is available. Interestingly, our results show that the probabilities of object access do not ...
Very Large Data Bases, Sep 1, 2006
22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)
Lecture Notes in Computer Science, 2005
2007 IEEE 23rd International Conference on Data Engineering, 2007