1068 search results - page 91 / 214 » Factorization as a Rank 1 Problem |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
119
click to vote
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
— Many real-world applications have problems when learning from imbalanced data sets, such as medical diagnosis, fraud detection, and text classification. Very few minority clas...
SIGSOFT
2010
ACM
14 years 8 months ago
2010
ACM
Diversity of skills is good for society, it is also good in problem solving because different people see a problem from several perspectives, so diversity should be good for softw...
ASIACRYPT
2010
Springer
14 years 8 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...