Sciweavers

2200 search results - page 291 / 440
» Bloch's Constant is Computable
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
COMGEO
2008
ACM
15 years 6 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
DKE
2006
125views more  DKE 2006»
15 years 6 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
IJSYSC
2008
100views more  IJSYSC 2008»
15 years 6 months ago
Visual motion and structure estimation using sliding mode observers
The problem of estimating motion and structure from a sequence of images has been a major research theme in machine vision for many years and remains one of the most challenging o...
Mustafa Unel, Asif Sabanovic, Burak Yilmaz, Eray D...