公開日 Auctions with Severely Bounded Communications Liad Blumrosen, Noam Nisan, Ilya Segal Journal of Artificial Intelligence Research | January 2007, 巻28: pp. 233-266
公開日 Learning to Rank with Non-Smooth Cost Functions C.J.C. Burges, R. Ragno, Q.V. Le, Chris J.C. Burges Advances in Neural Information Processing Systems 19 | January 2007
公開日 Point-to-Point Shortest Path Algorithms with Preprocessing Andrew Goldberg Current Trends in Theory and Practice of Computer Science (SOFSEM) | January 2007 Invited Lecture
公開日 Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs Uriel Feige, Mohit Singh In Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 | January 2007
公開日 Scalable Training of L1-Regularized Log-Linear Models Galen Andrew, Jianfeng Gao International Conference on Machine Learning | January 2007
公開日 Acronym-Expansion Recognition and Ranking on the Web S. Cucerzan, S. Azzam, A. Jain, Silviu Cucerzan Proceedings of IEEE-IRI 2007 | January 2007 Proceedings of IEEE-IRI 2007
公開日 Volume and shape preservation via moving frame manipulation Yaron Lipman, Daniel Cohen-Or, Ran Gal, David Levin ACM Transactions on Graphics (TOG) | January 2007, 巻26(1)
公開日 An Ω(n^{1/3}) lower bound for bilinear group based private information retrieval Alexander Razborov, Sergey Yekhanin Theory of Computing | January 2007, 巻3: pp. 223-238
公開日 Towards 3-query locally decodable codes of subexponential length Sergey Yekhanin Journal of the ACM | January 2007, 巻55(1): pp. 1-16