Sciweavers

425 search results - page 46 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
ICDCS
2000
IEEE
15 years 3 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 23 days ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
CLUSTER
2011
IEEE
13 years 11 months ago
A Framework for Data-Intensive Computing with Cloud Bursting
—For many organizations, one attractive use of cloud resources can be through what is referred to as cloud bursting or the hybrid cloud. These refer to scenarios where an organiz...
Tekin Bicer, David Chiu, Gagan Agrawal
LATIN
2010
Springer
15 years 6 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
CCGRID
2007
IEEE
15 years 5 months ago
Integrated Data Reorganization and Disk Mapping for Reducing Disk Energy Consumption
Increasing power consumption of high-performance systems leads to reliability, survivability, and cooling related problems. Motivated by this observation, several recent efforts f...
Seung Woo Son, Mahmut T. Kandemir