Sciweavers

661 search results - page 7 / 133
» What Can We Expect from Program Verification
Sort
View
MFCS
2005
Springer
14 years 2 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
FORMATS
2010
Springer
13 years 6 months ago
A Framework for Verification of Software with Time and Probabilities
Abstract. Quantitative verification techniques are able to establish system properties such as "the probability of an airbag failing to deploy on demand" or "the exp...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
HICSS
2009
IEEE
179views Biometrics» more  HICSS 2009»
14 years 3 months ago
Understanding Continuance Intention of Knowledge Creation in Online Communities from a Social-Psychological Perspective
Grounded on both social cognitive theory and expectation-disconfirmation theory (EDT), this study aims to investigate how individuals’ continuance intention of knowledge creatio...
Shih-Wei Chou, Ching-Chang Lee, Yu-Chieh Chang, Ch...
CCS
2006
ACM
14 years 9 days ago
Bridging the gap between web application firewalls and web applications
Web applications are the Achilles heel of our current ICT infrastructure. NIST's national vulnerability database clearly shows that the percentage of vulnerabilities located ...
Lieven Desmet, Frank Piessens, Wouter Joosen, Pier...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 4 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson