415 search results - page 46 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
109
click to vote
DPD
2002
14 years 11 months ago
2002
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
135
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
142
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
JACM
2007
14 years 11 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...