5100 search results - page 553 / 1020 » The Linear Complexity of a Graph |
189
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational compl...
205
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
207
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
196
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
235
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...