Sciweavers

98 search results - page 10 / 20
» Conditional Independence Relations in Possibility Theory
Sort
View
93
Voted
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
15 years 12 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
98
Voted
JELIA
1990
Springer
15 years 3 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 6 months ago
Picturing classical and quantum Bayesian inference
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
Bob Coecke, Robert W. Spekkens
IROS
2007
IEEE
149views Robotics» more  IROS 2007»
15 years 6 months ago
Kernel-based visual servoing
— Traditionally, visual servoing is separated into tracking and control subsystems. This separation, though convenient, is not necessarily well justified. When tracking and cont...
Vinutha Kallem, Maneesh Dewan, John P. Swensen, Gr...
PODS
2010
ACM
249views Database» more  PODS 2010»
15 years 4 months ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...