Sciweavers

2095 search results - page 309 / 419
» Improved pebbling bounds
Sort
View
VLSID
2009
IEEE
115views VLSI» more  VLSID 2009»
14 years 10 months ago
Efficient Techniques for Directed Test Generation Using Incremental Satisfiability
Functional validation is a major bottleneck in the current SOC design methodology. While specification-based validation techniques have proposed several promising ideas, the time ...
Prabhat Mishra, Mingsong Chen
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 10 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 10 months ago
Signing a Linear Subspace: Signature Schemes for Network Coding
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
Dan Boneh, David Freeman, Jonathan Katz, Brent Wat...
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 10 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 10 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar