3875 search results - page 150 / 775 » Approximation algorithms for the 0-extension problem |
137
click to vote
CSE
2008
IEEE
15 years 6 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...
140
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
127
click to vote
SOFSEM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
128
click to vote
TASLP
2010
14 years 11 months ago
2010
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
168
Voted
TNN
2010
14 years 11 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...