Sciweavers

3927 search results - page 40 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 7 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
CSCWD
2008
Springer
15 years 8 months ago
Development of a project level performance measurement model for improving collaborative design team work
This research explored a new direction of improving collaborative design by performance measurement. More specifically, a novel 3-dimensional performance measurement model is deve...
Yuanyuan Yin, Shengfeng Qin, Ray Holland
COLING
2008
15 years 7 months ago
Exploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
ICS
1999
Tsinghua U.
15 years 10 months ago
Improving the performance of bristled CC-NUMA systems using virtual channels and adaptivity
Current high-end parallel systems achieve low-latency, highbandwidth network communication through the use of aggressive design techniques and expensive mechanical and electrical ...
José F. Martínez, Josep Torrellas, J...
NOCS
2010
IEEE
15 years 4 months ago
Asynchronous Bypass Channels: Improving Performance for Multi-synchronous NoCs
Abstract--Networks-on-Chip (NoC) have emerged as a replacement for traditional shared-bus designs for on-chip communications. As with all current VLSI designs, however, reducing po...
Tushar N. K. Jain, Paul V. Gratz, Alexander Sprint...