7123 search results - page 77 / 1425 » The Ordered Set of Rough Sets |
CP
2007
Springer
14 years 4 months ago
2007
Springer
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
The level set representation of shapes is useful for shape evolution and is widely used for the minimization of energies with respect to shapes. Many algorithms consider energies d...
IJET
2010
13 years 8 months ago
2010
- According to the rapid changes in our life styles and in order to cope with the new requirements for modern learning settings and activities, several applications have been devel...
EUSFLAT
2009
13 years 7 months ago
2009
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
LREC
2008
13 years 11 months ago
2008
We address the question of which syntactic representation is best suited for role-semantic analysis of English in the FrameNet paradigm. We compare systems based on dependencies a...