11 search results - page 2 / 3 » Learning a Hidden Graph Using O(log n) Queries Per Edge |
121
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
128
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
117
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
110
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
147
click to vote
ML
2010
ACM
15 years 1 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...