Sciweavers

1007 search results - page 114 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IPPS
2002
IEEE
15 years 7 months ago
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
Gang George Yin, Cheng-Zhong Xu, Le Yi Wang
117
Voted
DMSN
2005
ACM
15 years 4 months ago
Timely data delivery in sensor networks using whirlpool
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical mo...
Divyasheel Sharma, Vladimir Zadorozhny, Panos K. C...
152
Voted
IPPS
2003
IEEE
15 years 8 months ago
Gene Clustering Using Self-Organizing Maps and Particle Swarm Optimization
Gene clustering, the process of grouping related genes in the same cluster, is at the foundation of different genomic studies that aim at analyzing the function of genes. Microarr...
Xiang Xiao, Ernst R. Dow, Russell C. Eberhart, Zin...
CODES
2005
IEEE
15 years 8 months ago
Improving superword level parallelism support in modern compilers
Multimedia vector instruction sets are becoming ubiquitous in most of the embedded systems used for multimedia, networking and communications. However, current compiler technology...
Christian Tenllado, Luis Piñuel, Manuel Pri...
119
Voted
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 2 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo