93 search results - page 13 / 19 » Information-Based Nonlinear Approximation: An Average Case S... |
154
click to vote
JOIN
2007
15 years 5 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
155
click to vote
ICC
2008
IEEE
16 years 4 days ago
2008
IEEE
— This paper studies the performance of transmission schemes that have rate that increases with average SNR while maintaining a fixed outage probability. This is in contrast to ...
202
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
15 years 21 days ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
173
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
179
click to vote
AAAI
2007
15 years 8 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...