Abstract. The method of lexical chains is the first time introduced to generate summaries from Chinese texts. The algorithm which computes lexical chains based on the HowNet knowl...
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
New placement techniques are presented which substantially improve the process of automatic layout generation of analog IC's. Extremely tight specifications can be enforced o...
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...