Results 211 to 220 of about 214,223 (252)
Some of the next articles are maybe not open access.
The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005., 2005
Summary form only given. Mining user access patterns from clickstream data has attracted much attention from the research community. However, the scalability testing of corresponding mining algorithms has been virtually ignored. Memory requirements of these algorithms may be quite large due to the fact that in-memory data structures whose size depends ...
J. Mizher +3 more
openaire +2 more sources
Summary form only given. Mining user access patterns from clickstream data has attracted much attention from the research community. However, the scalability testing of corresponding mining algorithms has been virtually ignored. Memory requirements of these algorithms may be quite large due to the fact that in-memory data structures whose size depends ...
J. Mizher +3 more
openaire +2 more sources
A scalable watermarking scheme for the scalable audio coder
IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005In this paper, we describe a scalable (i.e., lossy-to-lossless) watermarking scheme which overcomes the problem of non-invertible distortion introduced by the watermark signal. The scheme is based on a standardized scalable audio coder (R.S. Yu, et al, 2004) -as a result, the embedded watermark inherits the scalability of the audio coder.
Zhi Li 0001 +3 more
openaire +2 more sources
Computation-scalable algorithm for scalable video coding
IEEE Transactions on Consumer Electronics, 2011This paper presents a strategy that efficiently allocates the limited resource and still maintains the coding performance for the spatial scalability of H.264/SVC. An integrated computation-scalable algorithm is proposed on the basis of priority-based mode decision (PBMD) and activity-based motion estimation (ABME).
Te-Heng Wang +4 more
openaire +2 more sources
Scalable group communication system for scalable trust
Proceedings of the first ACM workshop on Scalable trusted computing, 2006Programmers of large-scale trusted systems need tools to simplify tasks such as replicating services or data. Group communication systems achieve this via various flavors of reliable multicast, but the existing solutions do not scale in all major dimensions. Typically, they scale poorly in the number of groups; yet we believe that using groups casually
Krzysztof Ostrowski, Kenneth P. Birman
openaire +2 more sources
2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, 2015
Data-intensive scientific workflows are composed of many tasks that exhibit data precedence constraints leading to communication schemes expressed by means of intermediate files. In such scenarios, the storage layer is often a bottleneck, limiting overall application scalability, due to large volumes of data being generated during runtime at high I/O ...
Alexandru Uta +3 more
openaire +2 more sources
Data-intensive scientific workflows are composed of many tasks that exhibit data precedence constraints leading to communication schemes expressed by means of intermediate files. In such scenarios, the storage layer is often a bottleneck, limiting overall application scalability, due to large volumes of data being generated during runtime at high I/O ...
Alexandru Uta +3 more
openaire +2 more sources
On the Scalability of HeapCheck
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks - Supplemental Volume (DSN-S), 2022Rick Boivie +4 more
openaire +2 more sources
IEEE Transactions on Parallel and Distributed Systems, 2014
Detecting and isolating bugs that arise only at high processor counts is a challenging task. Over a number of years, we have implemented a special debugging method, called 'relative debugging,' that supports debugging applications as they evolve or are ported to larger machines. It allows a user to compare the state of a suspect program against another
Minh Ngoc Dinh +2 more
openaire +4 more sources
Detecting and isolating bugs that arise only at high processor counts is a challenging task. Over a number of years, we have implemented a special debugging method, called 'relative debugging,' that supports debugging applications as they evolve or are ported to larger machines. It allows a user to compare the state of a suspect program against another
Minh Ngoc Dinh +2 more
openaire +4 more sources
The Perceptual Scalability of Visualization
IEEE Transactions on Visualization and Computer Graphics, 2006Larger, higher resolution displays can be used to increase the scalability of information visualizations. But just how much can scalability increase using larger displays before hitting human perceptual or cognitive limits? Are the same visualization techniques that are good on a single monitor also the techniques that are best when they are scaled up ...
Beth Yost, Chris North 0001
openaire +2 more sources
A systematic review of blockchain scalability: Issues, solutions, analysis and future research
Journal of Network and Computer Applications, 2021Abdurrashid Ibrahim Sanka +1 more
exaly