415 search results - page 10 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
ACSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
IMAMS
2003
13 years 9 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
MDM
2009
Springer
14 years 2 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...