Sciweavers

266 search results - page 49 / 54
» Chromatic Ramsey numbers
Sort
View
JGAA
2007
104views more  JGAA 2007»
13 years 7 months ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
JGT
2007
99views more  JGT 2007»
13 years 7 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 7 months ago
On the Difficulty of Designing Good Classifiers
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...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
BMVC
2010
13 years 5 months ago
Classifying Textile Designs using Region Graphs
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keit...
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
SEQADAPT: an adaptable system for the tracking, storage and analysis of high throughput sequencing experiments
Background: High throughput sequencing has become an increasingly important tool for biological research. However, the existing software systems for managing and processing these ...
David B. Burdick, Christopher C. Cavnor, Jeremy Ha...