5100 search results - page 134 / 1020 » The Linear Complexity of a Graph |
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...
JMM2
2007
13 years 9 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
IMA
2001
Springer
14 years 1 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...