One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...