3267 search results - page 453 / 654 » Generalized quasirandom graphs |
170
click to vote
NIPS
2004
15 years 8 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
171
click to vote
FLAIRS
2000
15 years 8 months ago
2000
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
166
click to vote
GRAPHICSINTERFACE
2000
15 years 8 months ago
2000
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
184
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
170
click to vote
ACL
1993
15 years 8 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...