In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...