Sciweavers

1139 search results - page 125 / 228
» Bounded Ideation Theory
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
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 ...
Nikos Komodakis, Georgios Tziritas
INFOCOM
2010
IEEE
13 years 6 months ago
Collaborative Measurements of Upload Speeds in P2P Systems
—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...
John R. Douceur, James W. Mickens, Thomas Moscibro...
TALG
2010
110views more  TALG 2010»
13 years 6 months ago
Approximating fractional hypertree width
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], ...
Dániel Marx
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Matched Filtering from Limited Frequency Samples
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-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
JSAC
2011
150views more  JSAC 2011»
13 years 2 months ago
Probabilistic Delay Control and Road Side Unit Placement for Vehicular Ad Hoc Networks with Disrupted Connectivity
—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,...
Atef Abdrabou, Weihua Zhuang