Sciweavers

654 search results - page 40 / 131
» Ordered Sets and Complete Lattices
Sort
View
ICALP
1998
Springer
13 years 12 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
CAD
2002
Springer
13 years 7 months ago
Free-form design using axial curve-pairs
Deformation of 3D shapes usually requires the use of a deformation tool. The freeform deformation technique requires the use of a lattice of control point for deforming an object....
K. C. Hui
DM
2007
84views more  DM 2007»
13 years 7 months ago
Matroids on convex geometries (cg-matroids)
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
AAAI
2006
13 years 9 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez