Sciweavers

91 search results - page 16 / 19
» The Second Calculus of Binary Relations
Sort
View
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 4 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 7 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
EUSFLAT
2009
181views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Fuzzy Concept Lattice is Made by Proto-Fuzzy Concepts
Abstract-- An L-fuzzy context is a triple consisting of a set of objects, a set of attributes and an L-fuzzy binary relation between them. An l-cut is a classical context over the ...
Ondrej Kridlo, Stanislav Krajci
CVPR
1998
IEEE
14 years 9 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
CPC
1999
105views more  CPC 1999»
13 years 7 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill