11 search results - page 3 / 3 » Learning a Hidden Graph Using O(log n) Queries Per Edge |
130
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...