Sciweavers

3305 search results - page 184 / 661
» Can we Rely on SQL
Sort
View
CSL
2005
Springer
14 years 4 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
ESWS
2005
Springer
14 years 4 months ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
14 years 4 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
IJCNLP
2005
Springer
14 years 4 months ago
Using the Structure of a Conceptual Network in Computing Semantic Relatedness
Abstract. We present a new method for computing semantic relatedness of concepts. The method relies solely on the structure of a conceptual network and eliminates the need for perf...
Iryna Gurevych
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 4 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran