Sciweavers

2168 search results - page 55 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
HPCA
2006
IEEE
16 years 2 months ago
Store vectors for scalable memory dependence prediction and scheduling
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
Samantika Subramaniam, Gabriel H. Loh
RECOMB
1997
Springer
15 years 6 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
PPNA
2011
14 years 9 months ago
LiquidStream - network dependent dynamic P2P live streaming
A successful P2P live streaming system must achieve high uploading bandwidth utilization, fast stream distribution, fair aggregate bandwidth distribution among participating nodes,...
Nikolaos Efthymiopoulos, Athanasios Christakidis, ...
CASES
2007
ACM
15 years 6 months ago
Performance optimal processor throttling under thermal constraints
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...
Ravishankar Rao, Sarma B. K. Vrudhula
APGV
2008
ACM
145views Visualization» more  APGV 2008»
15 years 4 months ago
On optimal resampling of view and illumination dependent textures
The use of illumination and view dependent textural information is one way to capture the realistic appearance of genuine materials. One example of such data is the bidirectional ...
Jirí Filip, Mike J. Chantler, Michal Haindl