463 search results - page 71 / 93 » The lattice dimension of a graph |
PAMI
2006
14 years 9 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
146
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
AUTOMATICA
2007
2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
14 years 9 months ago
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...