Sciweavers

4066 search results - page 130 / 814
» Almost Complete Sets
Sort
View
AAAI
1990
15 years 7 months ago
Skolem Functions and Equality in Automated Deduction
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
William McCune
CSR
2007
Springer
16 years 17 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
ICPR
2004
IEEE
16 years 7 months ago
Type-2 Fuzzy Hidden Markov Models to Phoneme Recognition
This paper presents a novel extension of Hidden Markov Models (HMMs): type-2 fuzzy HMMs (type-2 FHMMs). The advantage of this extension is that it can handle both randomness and f...
Jia Zeng, Zhi-Qiang Liu
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 12 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
EPIA
2001
Springer
15 years 11 months ago
Proportional Membership in Fuzzy Clustering as a Model of Ideal Types
The goal of this paper is to further investigate the extreme behaviour of the proportional membership model (FCPM) in contrast to the central tendency of fuzzy c-means (FCM). A dat...
Susana Nascimento, Boris Mirkin, Fernando Moura-Pi...