492 search results - page 13 / 99 » Perfect Matching Preservers |
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper proposes a new class of two-channel structural perfect reconstruction (PR) FIR filter banks (FBs) called the multi-plet FB. It generalizes structural PR FBs proposed by...
123
click to vote
AAAI
1990
15 years 1 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
COMBINATORICS
1998
14 years 11 months ago
1998
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
123
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
175
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need...