3894 search results - page 439 / 779 » Approximation Algorithms for Biclustering Problems |
151
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
127
click to vote
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
157
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
181
Voted
TWC
2010
14 years 11 months ago
2010
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
145
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...