Sciweavers

301 search results - page 3 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
CONPAR
1992
14 years 15 days ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
SIGSOFT
2003
ACM
14 years 9 months ago
Tracking pointers with path and context sensitivity for bug detection in C programs
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
V. Benjamin Livshits, Monica S. Lam
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
14 years 9 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ICIP
2004
IEEE
14 years 10 months ago
Efficient path aggregation and error control for video streaming
This paper presents an efficient multiplexing and error control system to improve streaming video performance over path aggregates. While providing the application with increased ...
Omesh Tickoo, Shivkumar Kalyanaraman, John W. Wood...
ICCAD
2003
IEEE
115views Hardware» more  ICCAD 2003»
14 years 5 months ago
Efficient Verification of Hazard-Freedom in Gate-Level Timed Asynchronous Circuits
This paper presents an efficient method for verifying hazard freedom in timed asynchronous circuits. Timed circuits are a class of asynchronous circuits that utilize explicit tim...
Curtis A. Nelson, Chris J. Myers, Tomohiro Yoneda