نتایج جستجو برای: data access time

تعداد نتایج: 3990836  

Journal: :European Journal of Public Health 2021

Journal: :CoRR 2016
Anwaar Ali Junaid Qadir Raihan Ur Rasool Arjuna Sathiaseelan Andrej Zwitter

With the explosion of social media sites and proliferation of digital computing devices and Internet access, massive amounts of public data is being generated on a daily basis. Efficient techniques/ algorithms to analyze this massive amount of data can provide near real-time information about emerging trends and provide early warning in case of an imminent emergency (such as the outbreak of a v...

2007
Subramanian Ramaswamy Sudhakar Yalamanchili

The central data structures for many applications in scientific computing are large multidimensional arrays. These arrays dominate memory accesses and are often accessed with strides that vary across orthogonal dimensions posing a central and critical challenge to develop effective caching strategies. We propose a novel technique to optimize cache placement for multidimensional arrays with the ...

2004
JIANTING ZHANG Changwook Kim

Geographical data broadcasting is suitable for many large scale disseminationbased applications due to its independence of number of users, and thus it can serve as an important part of intelligent information infrastructures for modern cities. In broadcast systems, query response time is greatly affected by the order in which data items are being broadcast. However, existing broadcast ordering...

2014
N. Mansouri A. Asadi

Data Grid is a geographically distributed environment that deals with data intensive application in scientific and enterprise computing. Data replication is a common method used to achieve efficient and fault-tolerant data access in Grids. In this paper, a dynamic data replication strategy, called Enhanced Latest Access Largest Weight (ELALW) is proposed. This strategy is an enhanced version of...

1999
Bixio Rimoldi

It is shown that the encoding/decoding problem for any asynchronous M -user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M 1 single-user memoryless channels. This is done via a method called time-splitting multiple-access which is closely related to a recently developed method called rate-splitting multiple access. It is also related to to multilevel ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید