Sciweavers

923 search results - page 122 / 185
» Proving the value of formal methods
Sort
View
RTCSA
1998
IEEE
15 years 10 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...
WWW
2005
ACM
16 years 7 months ago
Web service interfaces
We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies th...
Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzing...
ICIP
2005
IEEE
16 years 7 months ago
Generalized Histogram Intersection Kernel for Image Recognition
Histogram Intersection (HI) kernel has been recently introduced for image recognition tasks. The HI kernel is proved to be positive definite and thus can be used in Support Vector ...
Sabri Boughorbel, Jean-Philippe Tarel and Nozha Bo...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 13 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller