Sciweavers

2356 search results - page 10 / 472
» Characterizations of postman sets
Sort
View
GBRPR
2007
Springer
15 years 3 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
SIAMCOMP
2011
14 years 6 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
ICPR
2004
IEEE
16 years 27 days ago
The Characterization of Classification Problems by Classifier Disagreements
In this paper we try to characterize a set of classification problems. For this, we use the disagreement between a set of standard classifiers. The disagreement patterns do not on...
David M. J. Tax, Elzbieta Pekalska, Robert P. W. D...
IDA
2011
Springer
14 years 6 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
HPCA
2012
IEEE
13 years 7 months ago
SCD: A scalable coherence directory with flexible sharer set encoding
Large-scale CMPs with hundreds of cores require a directory-based protocol to maintain cache coherence. However, previously proposed coherence directories are hard to scale beyond...
Daniel Sanchez, Christos Kozyrakis