4670 search results - page 813 / 934 » Testing that distributions are close |
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the...
177
click to vote
ISI
2006
Springer
15 years 6 months ago
2006
Springer
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
150
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
138
click to vote
JCST
2006
15 years 6 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
164
click to vote
JSW
2008
15 years 6 months ago
2008
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...