6045 search results - page 33 / 1209 » Computable Linearizations of Well-partial-orderings |
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
TAMC
2010
Springer
13 years 6 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
TIT
1998
13 years 7 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
ICCV
2009
IEEE
15 years 22 days ago
2009
IEEE
This paper studies automatic segmentation of multiple
motions from tracked feature points through spectral embedding
and clustering of linear subspaces. We show that
the dimensi...
ESA
2001
Springer
14 years 8 days ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...