Sciweavers

1673 search results - page 129 / 335
» Taming the Dynamics of Distributed Data
Sort
View
ICPADS
2010
IEEE
15 years 4 months ago
Data-Aware Task Scheduling on Multi-accelerator Based Platforms
To fully tap into the potential of heterogeneous machines composed of multicore processors and multiple accelerators, simple offloading approaches in which the main trunk of the ap...
Cédric Augonnet, Jérôme Clet-O...
IPPS
2008
IEEE
16 years 17 days ago
A game theoretical data replication technique for mobile ad hoc networks
Adaptive replication of data items on servers of a mobile ad hoc network can alleviate access delays. The selection of data items and servers requires solving a constrained optimi...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
TKDE
2010
184views more  TKDE 2010»
15 years 4 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
16 years 14 days ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
IPPS
1999
IEEE
15 years 10 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...