Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
In this work we learn clusters of contextual annotations for non-terminals in the Penn Treebank. Perhaps the best way to think about this problem is to contrast our work with that...
William P. Headden III, Eugene Charniak, Mark John...
Accurate and reliable protein structure prediction (PSP) eludes researchers primarily becausethe searchfor theminimumenergyconformeris computationallyintractable. This research di...
Charles E. Kaiser, Laurence D. Merkle, Gary B. Lam...
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...