Sciweavers

3757 search results - page 252 / 752
» The overlap number of a graph
Sort
View
ICAPR
2005
Springer
16 years 3 days ago
Texture Exemplars for Defect Detection on Random Textures
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
Xianghua Xie, Majid Mirmehdi
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
16 years 2 days ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
UM
2005
Springer
16 years 1 days ago
Exploiting Probabilistic Latent Information for the Construction of Community Web Directories
This paper improves a recently-presented approach to Web Personalization, named Community Web Directories, which applies personalization techniques to Web Directories. The Web dire...
Dimitrios Pierrakos, Georgios Paliouras
NPAR
2004
ACM
16 years 11 hour ago
Rendering complexity in computer-generated pen-and-ink illustrations
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
Brett Wilson, Kwan-Liu Ma
CSCLP
2004
Springer
15 years 12 months ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf