Sciweavers

2477 search results - page 61 / 496
» Approximate extended formulations
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Pi-Calculus in Logical Form
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
Marcello M. Bonsangue, Alexander Kurz
TIP
2011
106views more  TIP 2011»
13 years 4 months ago
Practical Bounds on Image Denoising: From Estimation to Information
—Recently, in a previous work, we proposed a way to bound how well any given image can be denoised. The bound was computed directly from the noise-free image that was assumed to ...
Priyam Chatterjee, Peyman Milanfar
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
KR
2004
Springer
14 years 3 months ago
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontolog...
Patrick Doherty, Andrzej Szalas, Witold Lukaszewic...
MOC
2000
96views more  MOC 2000»
13 years 9 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie