Sciweavers

203 search results - page 39 / 41
» How Program History Can Improve Code Completion
Sort
View
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
IPPS
2003
IEEE
15 years 2 months ago
Extending OpenMP to Support Slipstream Execution Mode
OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalabi...
Khaled Z. Ibrahim, Gregory T. Byrd
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 10 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
MM
2009
ACM
163views Multimedia» more  MM 2009»
15 years 4 months ago
Peer-assisted packet loss repair for IPTV video multicast
Emerging IPTV technology uses source-specific IP multicast to deliver TV programs to the end-users. To provide timely and reliable services over the error-prone DSL access networ...
Zhi Li, Xiaoqing Zhu, Ali C. Begen, Bernd Girod
CCGRID
2006
IEEE
15 years 3 months ago
Adapting Distributed Shared Memory Applications in Diverse Environments
A problem with running distributed shared memory applications in heterogeneous environments is that making optimal use of available resources often requires significant changes t...
Daniel Potts, Ihor Kuz