Sciweavers

2430 search results - page 466 / 486
» Computing Tutte Polynomials
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec
CSFW
2007
IEEE
14 years 2 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
ICEBE
2007
IEEE
126views Business» more  ICEBE 2007»
14 years 2 months ago
Consumer-Centric Web Services Discovery and Subscription
Nowadays, there are a number of similar web services over the internet or intranet. They provide consumers with more choices according to their personalized QoS requirements. Howe...
Xuanzhe Liu, Li Zhou, Gang Huang, Hong Mei
TPHOL
2007
IEEE
14 years 2 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma