Sciweavers

64 search results - page 8 / 13
» Exact path sensitization in timing analysis
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 3 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
COMPSAC
2003
IEEE
14 years 2 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
INFOCOM
2010
IEEE
13 years 8 months ago
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
—As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have t...
Jin Li, Qian Wang, Cong Wang, Ning Cao, Kui Ren, W...
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
14 years 4 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
AAAI
2008
13 years 12 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu