𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for term conflation based on tree structures

✍ Scribed by Irene Diaz; Jorge Morato; Juan Lloréns

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
119 KB
Volume
53
Category
Article
ISSN
1532-2882

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

AN ALGORITHM FOR INTEGRATING THE SPIN ON
AN ALGORITHM FOR INTEGRATING THE SPIN ON CONVECTED BASES
✍ G. NEFUSSI; N. DAHAN 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

A new algorithm is proposed for integrating the spin in the frame of large deformation analysis. The method is based on the integration of a matrix relation, obtained from an adapted decomposition of the deformation gradient, and directly written in convected co-ordinates. The input of this algorith

An efficient algorithm for multistate pr
An efficient algorithm for multistate protein design based on FASTER
✍ Benjamin D. Allen; Stephen L. Mayo 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB

## Abstract Most of the methods that have been developed for computational protein design involve the selection of side‐chain conformations in the context of a single, fixed main‐chain structure. In contrast, multistate design (MSD) methods allow sequence selection to be driven by the energetic con

Linear time algorithms for computing the
Linear time algorithms for computing the most reliable source on an unreliable tree network
✍ Xue, Guoliang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a

An efficient adaptive algorithm for edge
An efficient adaptive algorithm for edge detection based on the likelihood ratio test
✍ A. De Santis; D. Iacoviello 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB

## Abstract The edge detection problem in blurred and noisy 2‐D signals is dealt with. An adaptive signal processing algorithm is proposed which marks edge points according to an hypothesis test which compares the likelihoods of two models describing the local signal behaviour in the two cases of a