2137 search results - page 376 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
107
click to vote
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
122
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
126
click to vote
COMBINATORICA
2008
15 years 2 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
126
click to vote
AFRIGRAPH
2003
ACM
15 years 6 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
110
Voted
TCS
2008
15 years 2 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...