Sciweavers

751 search results - page 47 / 151
» The Distinguishing Chromatic Number
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 11 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
14 years 9 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...
CSB
2005
IEEE
143views Bioinformatics» more  CSB 2005»
15 years 4 months ago
Analysis of four different sets of predictive features for metalloproteins
Metals bound to the protein are important for functional or structural roles. Despite their importance there is a distinct lack of research for identification of metalloproteins f...
Huseyin Seker, Parvez I. Haris
FSE
2000
Springer
91views Cryptology» more  FSE 2000»
15 years 2 months ago
A Statistical Attack on RC6
This paper details the attack on RC6 which was announced in a report published in the proceedings of the second AES candidate conference (March 1999). Based on an observation on th...
Henri Gilbert, Helena Handschuh, Antoine Joux, Ser...
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
15 years 6 months ago
Harmonious Coloring on Subclasses of Colinear Graphs
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
Kyriaki Ioannidou, Stavros D. Nikolopoulos