Sciweavers

765 search results - page 2 / 153
» Graph Coloring with Rejection
Sort
View
JMLR
2010
161views more  JMLR 2010»
12 years 12 months ago
Accuracy-Rejection Curves (ARCs) for Comparing Classification Methods with a Reject Option
Data extracted from microarrays are now considered an important source of knowledge about various diseases. Several studies based on microarray data and the use of receiver operat...
Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, Bla...
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICIP
2007
IEEE
14 years 6 months ago
Multicues 2D Articulated Pose Tracking using Particle Filtering and Belief Propagation on Factor Graphs
This paper describes a method for articulated upper body tracking in monocular scenes. The compatibility between model and the image is estimated using one particle filter for eac...
Philippe Noriega, Olivier Bernier
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
13 years 8 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
GC
2008
Springer
13 years 5 months ago
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
Robert E. Jamison, Gretchen L. Matthews