1139 search results - page 125 / 228 » Bounded Ideation Theory |
150
click to vote
PAMI
2007
15 years 4 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
128
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
119
click to vote
TALG
2010
15 years 2 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
127
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
169
click to vote
JSAC
2011
14 years 11 months ago
2011
—This paper studies the multihop packet delivery delay in a low density vehicular ad hoc network (VANET). We address a disrupted vehicle-to-infrastructure communication scenario,...