Sciweavers

709 search results - page 58 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
CORR
2004
Springer
98views Education» more  CORR 2004»
14 years 9 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
RSA
2010
98views more  RSA 2010»
14 years 8 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
TCBB
2010
107views more  TCBB 2010»
14 years 8 months ago
A Metric on the Space of Reduced Phylogenetic Networks
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...
Luay Nakhleh
MOC
2010
14 years 4 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
ICDT
2009
ACM
119views Database» more  ICDT 2009»
15 years 10 months ago
Incremental XPath evaluation
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
Henrik Björklund, Marcel Marquardt, Wim Marte...