356 search results - page 36 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
167
click to vote
STOC
2012
ACM
13 years 5 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 ...
134
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
118
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
130
click to vote
JMLR
2006
15 years 2 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
137
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...