In this paper we apply the ideas of algebraic topology to the analysis of the finite volume and finite element methods, illuminating the similarity between the discretization str...
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug...
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Humans can verify unknown parent-offspring and sibling pairs over unrelated subject pairs. A computational scheme to accomplish the task robustly, in the presence of challenges due...
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...