42 search results - page 4 / 9 » Linear And Hereditary Discrepancy |
85
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
76
Voted
ORDER
2002
14 years 11 months ago
2002
: In this paper we examine the interactions between the topology of certain linearly ordered topological spaces (LOTS) and the properties of trees in whose branch spaces they embed...
99
Voted
SIAMDM
2008
14 years 10 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
102
click to vote
IPCO
1992
15 years 25 days ago
1992
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
BMVC
2010
14 years 9 months ago
2010
Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity ...