Sciweavers

92 search results - page 12 / 19
» Intuitions and the modelling of defeasible reasoning: some c...
Sort
View
IPL
2008
89views more  IPL 2008»
13 years 7 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
FC
2004
Springer
78views Cryptology» more  FC 2004»
14 years 26 days ago
Secure Interaction Design
Abstract. The security of any computer system that is configured or operated by human beings critically depends on the information conveyed by the user interface, the decisions of...
Ka-Ping Yee
ICMCS
2006
IEEE
90views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Fast Video Object Selection for Interactive Television
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
Rémi Trichet, Bernard Mérialdo
LICS
2005
IEEE
14 years 1 months ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
FLAIRS
2007
13 years 9 months ago
Compositional Belief Update
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...
James P. Delgrande, Francis Jeffry Pelletier, Matt...