453 search results - page 42 / 91 » Tight bounds for the partial-sums problem |
118
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
112
click to vote
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
90
Voted
ALT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
84
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
102
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...