Back to Results
First PageMeta Content
Combinatorial optimization / Matching / Analysis of algorithms / Operations research / Dynamic programming / Optimal control / Hungarian algorithm / Algorithm / Time complexity / Theoretical computer science / Mathematics / Applied mathematics


CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad
Add to Reading List

Document Date: 2011-08-06 04:11:13

Open Document

File Size: 193,71 KB

Share Result on Facebook

City

Berlin / Medford / Cambridge / /

Company

B. / /

Currency

pence / /

/

Facility

Queen’s University / Rachel Hall / Tufts University / McGill University / NEC Research Institute / Harvard University / /

IndustryTerm

matrix multiplication algorithm / iterative algorithm / similar dynamic programming algorithm / natural language processing / dynamic programming algorithm / /

Organization

School of Computer Science / Harvard University / Department of Music / Department of Computer Science / Queen’s University / Kingston / School of Computing / Tufts University / McGill University / Montreal / NEC Research Institute / /

Person

David Rappaport Abstract Motivated / John Halle / Fernando Benadon / Jay Rahn / Ai / Steve Taylor / Bill Sethares / Adrian Childs / Godfried Toussaint / Dmitri Tymoczko / /

/

ProvinceOrState

Massachusetts / /

Technology

existing algorithm / natural language processing / time algorithm / 1 Algorithm / 2 Algorithm / The algorithm / dynamic programming algorithm / iterative algorithm / matrix multiplication algorithm / similar dynamic programming algorithm / 2011 Algorithm / /

SocialTag