5100 search results - page 132 / 1020 » The Linear Complexity of a Graph |
DCG
2011
13 years 4 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
IWCIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
IACR
2011
12 years 9 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...