Sciweavers

1149 search results - page 194 / 230
» Minimally non-Pfaffian graphs
Sort
View
CGF
2010
157views more  CGF 2010»
14 years 12 months ago
Binary Shading Using Appearance and Geometry
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
Bert Buchholz, Tamy Boubekeur, Doug DeCarlo, Marc ...
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
14 years 12 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
CVIU
2008
141views more  CVIU 2008»
14 years 12 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon
CLUSTER
2006
IEEE
14 years 12 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
14 years 12 months ago
Permutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
Mariana Raykova