Sciweavers

1302 search results - page 6 / 261
» Fair Equivalence Relations
Sort
View
EUSFLAT
2003
146views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Cut equivalence of fuzzy relations
Fuzzy relations on the same domain are classified according to the equality of families of cut sets. This equality of fuzzy relations is completely characterized, not only for un...
Branimir Seselja, Andreja Tepavcevic
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
13 years 11 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 2 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
DATAMINE
2006
83views more  DATAMINE 2006»
13 years 7 months ago
Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Djamel Bouchaffra, Jun Tan
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 11 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran