Sciweavers

11063 search results - page 184 / 2213
» On the existence of universal models
Sort
View
CSL
2010
Springer
15 years 7 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
JOLLI
2002
109views more  JOLLI 2002»
15 years 6 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
CVPR
2009
IEEE
17 years 1 months ago
Automated Feature Extraction for Early Detection of Diabetic Retinopathy in Fundus Images
Automated detection of lesions in retinal images can assist in early diagnosis and screening of a common disease: Diabetic Retinopathy. A robust and computationally efficient ap...
Saiprasad Ravishankar (University of Illinois Urba...
CVPR
2009
IEEE
17 years 1 months ago
Color Estimation from a Single Surface Color
This paper estimates illumination colors by using only a single surface color taken under multiple illumination colors. Past researchers have found that there is a difficulty in ...
Rei Kawakami (The University of Tokyo), Katsushi I...
FOCS
2009
IEEE
16 years 1 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi