2254 search results - page 83 / 451 » Computing the minimal covering set |
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
106
click to vote
EDBT
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
130
click to vote
COLING
2002
15 years 15 days ago
2002
In this paper we investigate the task of automatically identifying the correct argument structure for a set of verbs. The argument structure of a verb allows us to predict the rel...
91
Voted
JNS
2010
2010
Initiation of Cracks in Griffith's Theory: An Argument of Continuity in Favor of Global Minimization
14 years 7 months ago
The initiation of a crack in a sound body is a real issue in the setting of Griffith's theory of brittle fracture. If one uses the concept of critical energy release rate (Gri...
173
Voted
BMVC
2001
15 years 3 months ago
2001
In this paper we present a system that combines the benefits of 3D deformable models and level set methods for medical volume segmentation. Our 3D deformable model is a very comp...