420 search results - page 25 / 84 » Some Algorithmic Problems in Polytope Theory |
SAC
2004
ACM
15 years 5 months ago
2004
ACM
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
111
click to vote
KDD
2007
ACM
16 years 7 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
102
click to vote
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...