Sciweavers

1326 search results - page 84 / 266
» Approximate Tree Kernels
Sort
View
TMI
2002
115views more  TMI 2002»
13 years 8 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 15 days ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
DAM
2008
78views more  DAM 2008»
13 years 8 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
TLCA
2005
Springer
14 years 2 months ago
Continuity and Discontinuity in Lambda Calculus
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite...
Paula Severi, Fer-Jan de Vries
ACL
1998
13 years 10 months ago
Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation i...
Mark Johnson