A fast algorithm for optimally matching bids between users and items
- 总结
- Tony Jebara, Ph.D.
- 技术优势
- Finds 100% optimal solutions to large-scale matching problems.Exceptional computational speed Enhanced memory storage efficiency compared to similar algorithmsParticularly efficient for sparse graph cases, with there are fewer calls for matchingScales efficiently to handle problems of any sizePatent information:Patent Pending Tech Ventures Reference: IR M11-081
- 技术应用
- Quickly find optimal solutions of a variety of matching problemsOnline auction platforms' item-bid matchingSocial network and online dating site matching between usersExtend search engine functionalityResource allocation for large online merchants Other consumer/supplier operations management
- 详细技术说明
- Tony Jebara, Ph.D.
- *Abstract
-
None
- *Inquiry
- Jay HickeyColumbia Technology VenturesTel: (212) 854-8444Email: TechTransfer@columbia.edu
- *IR
- M11-081
- *Principal Investigation
-
- *Publications
- Fast b-matching via Sufficient Selection Belief Propagation, B. Huang and T. Jebara, 14th AISTATs Conference, April 2011.
- 国家/地区
- 美国
欲了解更多信息，请点击 这里
