6045 search results - page 235 / 1209 » Computable Linearizations of Well-partial-orderings |
NETWORKS
2010
13 years 6 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We introduce an epitomic representation for modeling human activities in video sequences. A video sequence is divided into segments within which the dynamics of objects is assumed...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Recent results on sparse coding and independent component analysis suggest that human vision first represents a visual image by a linear superposition of a relatively small number ...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
We studied the problem of distributed coding and transmission of intercorrelated sources with memory. Different from the conventional distributed source coding structure which rel...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...