Sciweavers

3927 search results - page 95 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
EACL
2006
ACL Anthology
15 years 7 months ago
Improving Probabilistic Latent Semantic Analysis with Principal Component Analysis
Probabilistic Latent Semantic Analysis (PLSA) models have been shown to provide a better model for capturing polysemy and synonymy than Latent Semantic Analysis (LSA). However, th...
Ayman Farahat, Francine Chen
PPAM
2005
Springer
15 years 12 months ago
Towards Distributed Monitoring and Performance Analysis Services in the K-WfGrid Project
The complexity and the dynamics of the Grid environment and of the emering workflow-based applications on the Grid require novel performance monitoring and analysis services in or...
Hong Linh Truong, Bartosz Balis, Marian Bubak, Jak...
MICRO
2009
IEEE
120views Hardware» more  MICRO 2009»
16 years 1 months ago
Tribeca: design for PVT variations with local recovery and fine-grained adaptation
With continued advances in CMOS technology, parameter variations are emerging as a major design challenge. Irregularities during the fabrication of a microprocessor and variations...
Meeta Sharma Gupta, Jude A. Rivers, Pradip Bose, G...
ANSS
2002
IEEE
15 years 11 months ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 7 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank