5100 search results - page 134 / 1020 » The Linear Complexity of a Graph |
134
click to vote
APPROX
2008
Springer
15 years 5 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...
122
click to vote
CVPR
2007
IEEE
16 years 5 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...
131
click to vote
JMM2
2007
15 years 3 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...
149
click to vote
ICASSP
2008
IEEE
15 years 10 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...
102
Voted
IMA
2001
Springer
15 years 8 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...