1308 search results - page 155 / 262 » Let's Have a Conversation |
188
click to vote
JCT
2010
15 years 1 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
177
click to vote
SIAMREV
2010
15 years 1 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
214
click to vote
CODCRY
2011
Springer
14 years 10 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
201
click to vote
PAKDD
2011
ACM
14 years 9 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
144
click to vote
TVCG
2012
13 years 8 months ago
2012
—Field design has wide applications in graphics and visualization. One of the main challenges in field design has been how to provide users with both intuitive control over the d...