Sciweavers

1982 search results - page 116 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
DAC
2004
ACM
16 years 5 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
JMLR
2002
140views more  JMLR 2002»
15 years 4 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
CASES
2006
ACM
15 years 8 months ago
Reaching fast code faster: using modeling for efficient software thread integration on a VLIW DSP
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...
Won So, Alexander G. Dean
SIGIR
2006
ACM
15 years 10 months ago
Capturing collection size for distributed non-cooperative retrieval
Modern distributed information retrieval techniques require accurate knowledge of collection size. In non-cooperative environments, where detailed collection statistics are not av...
Milad Shokouhi, Justin Zobel, Falk Scholer, Seyed ...
GPC
2009
Springer
15 years 11 months ago
Efficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
Karam Park, Joon-Sang Park, Won Woo Ro