332 search results - page 42 / 67 » Parameterized Graph Separation Problems |
SIAMCOMP
2000
13 years 7 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
PAMI
2010
13 years 2 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
JAL
2006
13 years 7 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...