Sciweavers

3228 search results - page 209 / 646
» Computationally Sound Proofs
Sort
View
TARK
2009
Springer
16 years 1 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
DAGSTUHL
2010
15 years 8 months ago
Computing an Optimal Layout for Cone Trees
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for ...
Dirk Zeckzer, Fang Chen, Hans Hagen
MST
2008
150views more  MST 2008»
15 years 6 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
14 years 6 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
IEEEARES
2008
IEEE
16 years 1 months ago
Application-Oriented Trust in Distributed Computing
Preserving integrity of applications being executed in remote machines is an open problem. Integrity requires that application code is not tampered with, prior to or during execut...
Riccardo Scandariato, Yoram Ofek, Paolo Falcarin, ...