Sciweavers

82 search results - page 2 / 17
» Intersecting data to closed sets with constraints
Sort
View
PAKDD
2004
ACM
117views Data Mining» more  PAKDD 2004»
13 years 10 months ago
Constraint-Based Mining of Formal Concepts in Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...
Jérémy Besson, Céline Robarde...
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 3 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
APAL
2007
79views more  APAL 2007»
13 years 5 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
ECCV
2004
Springer
14 years 6 months ago
A Closed-Form Solution to Non-rigid Shape and Motion Recovery
Recovery of three dimensional (3D) shape and motion of non-static scenes from a monocular video sequence is important for applications like robot navigation and human computer inte...
Jing Xiao, Jinxiang Chai, Takeo Kanade
IJCAI
1997
13 years 6 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...