1429 search results - page 62 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
119
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
WSCG
2004
14 years 11 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
CSE
2008
IEEE
14 years 11 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
NIPS
2007
14 years 11 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...