First Page | Document Content | |
---|---|---|
Date: 2013-01-07 05:09:09Matroid theory M-tree Greedy algorithm Area Distance Solid angle Dominating set Mathematics Combinatorics Theoretical computer science | C:/Users/Naira/Desktop/__TO BE UPLOADED/pvldb13-camera-ready/pvldb13.dviAdd to Reading ListSource URL: www.vldb.orgDownload Document from Source WebsiteFile Size: 2,63 MBShare Document on Facebook |
Greedy algorithm for large scale Nonnegative matrix/tensor decomposition ✦DocID: 1tDWz - View Document | |
The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗DocID: 1sdbY - View Document | |
Prof. Dr. Roger Wattenhofer phone +fax +Diploma/Master’s Thesis “Comparison of Ad Hoc Routing Algorithms”DocID: 1rmcF - View Document | |
Advances in Cognitive SystemsSubmitted; publishedVariations on a Theory of Problem Solving Pat LangleyDocID: 1r7U5 - View Document | |
Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the proDocID: 1qYO3 - View Document |