Sciweavers

2801 search results - page 241 / 561
» On the Adequateness of the Connection Method
Sort
View
CORR
2000
Springer
110views Education» more  CORR 2000»
15 years 6 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
EOR
2002
80views more  EOR 2002»
15 years 6 months ago
On generalized semi-infinite optimization and bilevel optimization
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a sp...
Oliver Stein, Georg Still
CAGD
1999
198views more  CAGD 1999»
15 years 6 months ago
Discrete Coons patches
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
Gerald E. Farin, Dianne Hansford
IJCGA
1998
97views more  IJCGA 1998»
15 years 6 months ago
Triangulation of Branching Contours Using Area Minimization
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the...
Mu Hong, Thomas W. Sederberg, Kris Klimaszewski, K...
DM
1999
62views more  DM 1999»
15 years 6 months ago
Directed animals, forests and permutations
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...