Sciweavers

16430 search results - page 315 / 3286
» On Computable Tree Functions
Sort
View
CCCG
1998
15 years 6 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
COLING
2010
14 years 12 months ago
Automatic analysis of semantic similarity in comparable text through syntactic tree matching
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
Erwin Marsi, Emiel Krahmer
AMC
2010
86views more  AMC 2010»
15 years 5 months ago
BVMs for computing Sturm-Liouville symmetric potentials
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
Paolo Ghelardoni, Cecilia Magherini
SAC
2006
ACM
15 years 10 months ago
Building the functional performance model of a processor
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
Alexey L. Lastovetsky, Ravi Reddy, Robert Higgins
ENTCS
2006
161views more  ENTCS 2006»
15 years 4 months ago
Architecture Normalization for Component-based Systems
Being able to systematically change the original architecture of a component-based system to a desired target architecture without changing the set of functional requirements of t...
Lian Wen, R. Geoff Dromey