Sciweavers

4131 search results - page 72 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
FSTTCS
2009
Springer
15 years 9 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
WG
2004
Springer
15 years 8 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
15 years 4 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
CVPR
2003
IEEE
16 years 5 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 9 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...