A fast algorithm for optimally matching bids between users and items
- Summary
- Tony Jebara, Ph.D.
- Technology Benefits
- 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
- Technology Application
- 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
- Detailed Technology Description
- Tony Jebara, Ph.D.
- *Abstract
-
None
- *Inquiry
- Jay HickeyColumbia Technology VenturesTel: (212) 854-8444Email: TechTransfer@columbia.edu
- *IR
- M11-081
- *Principal Investigator
-
- *Publications
- Fast b-matching via Sufficient Selection Belief Propagation, B. Huang and T. Jebara, 14th AISTATs Conference, April 2011.
- Country/Region
- USA
For more information, please click Here

