Sciweavers

3702 search results - page 37 / 741
» All Pairings Are in a Group
Sort
View
93
Voted
IPL
2006
83views more  IPL 2006»
15 years 13 days ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
ENTCS
2008
153views more  ENTCS 2008»
15 years 13 hour ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
110
Voted
CIKM
2006
Springer
15 years 4 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
95
Voted
JCT
2010
64views more  JCT 2010»
14 years 11 months ago
A new source of seed pairs for Golay sequences of length 2m
In 2007 Jedwab and Parker proposed [10] that the natural viewpoint for a Golay complementary sequence is as a projection of a multi-dimensional Golay array. In 2008 Fiedler, Jedwa...
Frank Fiedler, Jonathan Jedwab, Amy Wiebe
86
Voted
CADE
2010
Springer
15 years 1 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp