5100 search results - page 344 / 1020 » The Linear Complexity of a Graph |
129
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
157
click to vote
AUSDM
2007
Springer
15 years 11 months ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
122
click to vote
IPCO
2007
15 years 6 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
126
Voted
COMBINATORICA
2007
15 years 5 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
129
click to vote
SEMCO
2007
IEEE
15 years 11 months ago
2007
IEEE
Model-driven development depends on good initial models. Creating these models by hand is a challenging task, because of complex specification documents and change requests. We p...