Sciweavers

3145 search results - page 74 / 629
» Algebraic Linear Orderings
Sort
View
140
Voted
LPAR
2010
Springer
15 years 1 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
110
Voted
ORDER
2008
86views more  ORDER 2008»
15 years 3 months ago
Comparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
Guram Bezhanishvili, Jacob Vosmaer
123
Voted
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
15 years 10 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia
147
Voted
ECCV
2006
Springer
16 years 5 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
COLT
2007
Springer
15 years 10 months ago
Property Testing: A Learning Theory Perspective
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
Dana Ron