Sciweavers

1058 search results - page 23 / 212
» It's Doomed; We Can Prove It
Sort
View
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 9 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
DALT
2007
Springer
14 years 4 months ago
Satisfying Maintenance Goals
A rational agent derives its choice of action from its beliefs and goals. Goals can be distinguished into achievement goals and maintenance goals. The aim of this paper is to defi...
Koen V. Hindriks, M. Birna van Riemsdijk
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
14 years 2 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
TCS
2011
13 years 4 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
SIAMIS
2011
13 years 20 days ago
Level Set Based Multispectral Segmentation with Corners
In this paper we propose an active contour model for segmentation based on the Chan-Vese model. The new model can capture inherent sharp features, i.e., the sharp corners of object...
Wenhua Gao, Andrea L. Bertozzi