Sciweavers

5084 search results - page 209 / 1017
» Proving Possibility Properties
Sort
View
IFIP
2004
Springer
15 years 11 months ago
Formal Analysis of a Fair Payment Protocol
We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
Jan Cederquist, Muhammad Torabi Dashti
APSEC
2002
IEEE
15 years 11 months ago
Symbolic Simulation of Hybrid Systems
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
Ralph-Johan Back, Cristina Cerschi Seceleanu, Jan ...
FOCS
2002
IEEE
15 years 11 months ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan
ICPR
2010
IEEE
15 years 11 months ago
Object Tracking by Structure Tensor Analysis
Covariance matrices have recently been a popular choice for versatile tasks like recognition and tracking due to their powerful properties as local descriptor and their low comput...
Michael Donoser, Stefan Kluckner, Horst Bischof
COLT
2001
Springer
15 years 11 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour