1429 search results - page 80 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ICTAI
2003
IEEE
14 years 2 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
DASFAA
2003
IEEE
14 years 2 months ago
2003
IEEE
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...