Sciweavers

1302 search results - page 31 / 261
» Fair Equivalence Relations
Sort
View
ORL
2010
158views more  ORL 2010»
13 years 2 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
CSDA
2008
128views more  CSDA 2008»
13 years 7 months ago
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
Chris H. Q. Ding, Tao Li, Wei Peng
ECCC
2008
98views more  ECCC 2008»
13 years 7 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
IJCAI
2007
13 years 9 months ago
r-grams: Relational Grams
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
Niels Landwehr, Luc De Raedt