Sciweavers

19866 search results - page 182 / 3974
» Computing all factorizations in ***
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
SIGCSE
2006
ACM
355views Education» more  SIGCSE 2006»
16 years 15 days ago
Why students with an apparent aptitude for computer science don't choose to major in computer science
The statistics show that the number of Computer Science majors is dropping across the United States. Possible reasons include a reduced number of jobs in the field, an incorrect p...
Lori Carter
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
16 years 1 months ago
Compatibility of partnered students in computer science education
This paper details the results of an investigation into the compatibility of partnered computer science students. The study involved approximately 290 students at the University o...
Joshua Sennett, Mark Sherriff
NIPS
2007
15 years 8 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
CVPR
2010
IEEE
15 years 4 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel