Sciweavers

4171 search results - page 641 / 835
» Choice numbers of graphs
Sort
View
MP
2002
176views more  MP 2002»
15 years 6 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
SCFBM
2008
143views more  SCFBM 2008»
15 years 6 months ago
LSID Tester, a tool for testing Life Science Identifier resolution services
Background: Life Science Identifiers (LSIDs) are persistent, globally unique identifiers for biological objects. The decentralised nature of LSIDs makes them attractive for identi...
Roderic D. M. Page
NLE
2010
166views more  NLE 2010»
15 years 5 months ago
Wisdom of crowds versus wisdom of linguists - measuring the semantic relatedness of words
In this article, we present a comprehensive study aimed at computing semantic relatedness of word pairs. We analyze the performance of a large number of semantic relatedness measu...
Torsten Zesch, Iryna Gurevych
EMNLP
2009
15 years 4 months ago
Cross-lingual Semantic Relatedness Using Encyclopedic Knowledge
In this paper, we address the task of crosslingual semantic relatedness. We introduce a method that relies on the information extracted from Wikipedia, by exploiting the interlang...
Samer Hassan, Rada Mihalcea
FAC
2010
107views more  FAC 2010»
15 years 3 months ago
Atomic actions, and their refinements to isolated protocols
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an isolated atomic action as a family of transitions with a common before-state, an...
Richard Banach, Gerhard Schellhorn