1225 search results - page 72 / 245 » Maximal Consistent Subsets |
121
Voted
NETWORKS
2010
15 years 1 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
134
Voted
ICTAI
2010
IEEE
15 years 22 days ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
126
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
130
Voted
EUROCRYPT
2011
Springer
14 years 6 months ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
108
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...