1279 search results - page 90 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
TALG
2010
13 years 7 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
ADHOCNOW
2003
Springer
14 years 2 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
ICPR
2006
IEEE
2006
IEEE
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
14 years 2 months ago
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...