SAC
2016
ACM
8 years 8 months ago
2016
ACM
For smoothing covariance functions, we propose two fast algorithms that scale linearly with the number of observations per function. Most available methods and software cannot smo...
SAC
2016
ACM
8 years 8 months ago
2016
ACM
Abstract Principal component analysis (PCA) is a wellestablished tool for identifying the main sources of variation in multivariate data. However, as a linear method it cannot desc...
GC
2016
Springer
8 years 8 months ago
2016
Springer
GC
2016
Springer
8 years 8 months ago
2016
Springer
Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph Kn that has no rainbow spanning subgraph with diameter at most t. We prove s(n, t) = n−2 2 ...
GC
2016
Springer
8 years 8 months ago
2016
Springer
GC
2016
Springer
8 years 8 months ago
2016
Springer
A mixed hypergraph is a triple H = (V, C, D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored...
GC
2016
Springer
8 years 8 months ago
2016
Springer
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. I...
107
click to vote
COMGEO
2016
ACM
8 years 8 months ago
2016
ACM
Let C = {c1, . . . , cn} be a collection of disjoint closed bounded convex sets in the plane. Suppose that one of them, say c1, represents a valuable object we want to uncover, an...
BIRTHDAY
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. At CHES 2001, Walter introduced the Big Mac attack against an implementation of rsa. It is an horizontal collision attack, based on the detection of common operands in tw...
BIRTHDAY
2016
Springer
8 years 8 months ago
2016
Springer