Sciweavers

10414 search results - page 381 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
ACL
1990
15 years 7 months ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen
4OR
2005
51views more  4OR 2005»
15 years 6 months ago
Sensitivity of trust-region algorithms to their parameters
Abstract In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the conte...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
AUTOMATICA
2005
94views more  AUTOMATICA 2005»
15 years 6 months ago
Algorithms for deterministic balanced subspace identification
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...
Ivan Markovsky, Jan C. Willems, Paolo Rapisarda, B...
PRL
1998
152views more  PRL 1998»
15 years 6 months ago
A 3D 6-subiteration thinning algorithm for extracting medial lines
Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Žthinning algorithm that directly extracts medial line...
Kálmán Palágyi, Attila Kuba
ACSC
2010
IEEE
15 years 1 months ago
A batch algorithm for maintaining a topological order
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
David J. Pearce, Paul H. J. Kelly