2356 search results - page 12 / 472 » Characterizations of postman sets |
IDA
2005
Springer
15 years 5 months ago
2005
Springer
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
148
click to vote
PICS
2003
15 years 1 months ago
2003
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achiev...
118
click to vote
JGT
2008
14 years 11 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
ENTCS
2007
14 years 11 months ago
2007
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
ICCVW
1999
Springer
15 years 4 months ago
1999
Springer
A new approach to characterizing the performance of point-correspondencealgorithmsis presented. Instead of relyingon any \ground truth', it uses the self-consistency of the o...