3702 search results - page 11 / 741 » All Pairings Are in a Group |
123
click to vote
DM
2008
15 years 6 months ago
2008
In the present note, we investigate schemes S in which each element s satisfies ns 2 and nss = 2. We show that such a scheme is schurian. More precisely, we show that it is isomor...
161
click to vote
JGT
2006
15 years 6 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
231
Voted
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anticorrelation...
152
click to vote
CIA
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Evaluations of distances or similarity measurements are very important in cooperative problem solving with multiple agents. Distance between problems is used by agents to...
148
Voted
PODC
2000
ACM
15 years 9 months ago
2000
ACM
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which