Sciweavers

1182 search results - page 14 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
DPD
2010
153views more  DPD 2010»
13 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
VTC
2010
IEEE
121views Communications» more  VTC 2010»
13 years 5 months ago
MYRPA: An Incentive System with Reduced Payment Receipts for Multi-hop Wireless Networks
Abstract— In this paper, we propose an incentive system to stimulate the nodes’ cooperation in multi-hop wireless networks. Reducing the number and the size of the payment rece...
Mohamed Elsalih Mahmoud, Xuemin Shen
HIPEAC
2011
Springer
12 years 7 months ago
TypeCastor: demystify dynamic typing of JavaScript applications
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
Shisheng Li, Buqi Cheng, Xiao-Feng Li
AI
2006
Springer
13 years 11 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
CGO
2008
IEEE
13 years 9 months ago
Pipa: pipelined profiling and analysis on multi-core systems
Dynamic instrumentation systems are gaining popularity as means of constructing customized program profiling and analysis tools. However, dynamic instrumentation based analysis to...
Qin Zhao, Ioana Cutcutache, Weng-Fai Wong