Sciweavers

2252 search results - page 352 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
15 years 7 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...
SPAA
2010
ACM
15 years 6 months ago
Lightweight, robust adaptivity for software transactional memory
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
Michael F. Spear
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 5 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
TPDS
2008
125views more  TPDS 2008»
15 years 1 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
PERCOM
2006
ACM
16 years 1 months ago
Exploring Spatial Correlation for Link Quality Estimation in Wireless Sensor Networks
The irregularity in quality of wireless communication links poses significant research challenges in wireless sensor network design. Dynamic network conditions and environmental f...
Yingqi Xu, Wang-Chien Lee