Sciweavers

3145 search results - page 177 / 629
» Algebraic Linear Orderings
Sort
View
LPAR
2010
Springer
15 years 2 months ago
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
Friedrich Neurauter, Harald Zankl, Aart Middeldorp
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 10 days ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
ICA
2007
Springer
15 years 10 months ago
On Separation of Signal Sources Using Kernel Estimates of Probability Densities
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
Oleg V. Michailovich, Douglas Wiens
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 6 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
FSS
2006
85views more  FSS 2006»
15 years 4 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...