161 search results - page 14 / 33 » On the observability of linear systems from random, compress... |
130
click to vote
OPODIS
2007
15 years 3 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
124
click to vote
PAMI
2006
15 years 1 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
97
Voted
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
129
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
102
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...