We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
This paper reports an experiment aimed at generating synthetic test data for fraud detection in an IP based videoon-demand service. The data generation verifies a methodology pre...
-- This paper presents the current state of a work in progress, whose objective is to better understand the effects of factors that significantly influence the performance of the L...
Alain Lifchitz, Sandra Jhean-Larose, Guy Denhi&egr...
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
Samuel R. Buss, Christos H. Papadimitriou, John N....