Sciweavers

720 search results - page 33 / 144
» Linear k-arboricities on trees
Sort
View
ACL
1992
15 years 3 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
TIT
1998
86views more  TIT 1998»
15 years 1 months ago
A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric
—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...
Vladislav Sorokine, Frank R. Kschischang
ECCV
2006
Springer
15 years 5 months ago
Spatial Segmentation of Temporal Texture Using Mixture Linear Models
In this paper we propose a novel approach for the spatial segmentation of video sequences containing multiple temporal textures. This work is based on the notion that a single tem...
Lee Cooper, Jun Liu, Kun Huang
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
15 years 4 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
PC
2011
413views Management» more  PC 2011»
14 years 9 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...