7930 search results - page 99 / 1586 » Greedy in Approximation Algorithms |
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
174
click to vote
SIROCCO
2008
15 years 7 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
143
click to vote
COMCOM
2000
15 years 6 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
164
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
190
click to vote
ADMA
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...