Sciweavers

1201 search results - page 79 / 241
» Exact Analysis of Exact Change
Sort
View
ESOP
2000
Springer
14 years 18 days ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
COLING
2008
13 years 10 months ago
A Language-Independent Approach to Keyphrase Extraction and Evaluation
We present Likey, a language-independent keyphrase extraction method based on statistical analysis and the use of a reference corpus. Likey has a very light-weight preprocessing p...
Mari-Sanna Paukkeri, Ilari T. Nieminen, Matti P&ou...
CPHYSICS
2006
68views more  CPHYSICS 2006»
13 years 9 months ago
Hyperfine structure parametrisation in Maple
In hyperfine structure examinations, routine high resolution spectroscopy methods have to be combined with exact fine structure calculations. The so-called magnetic A and electric...
Gediminas Gaigalas, O. Scharf, S. Fritzsche
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 9 months ago
Automatically Restructuring Practice Guidelines using the GEM DTD
This paper describes a system capable of semi-automatically filling an XML template from free texts in the clinical domain (practice guidelines). The XML template includes semanti...
Amanda Bouffier, Thierry Poibeau
EJC
2007
13 years 9 months ago
On the number of matchings of a tree
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
Stephan G. Wagner