2569 search results - page 34 / 514 » Approximate Objects and Approximate Theories |
102
click to vote
ICCV
2005
IEEE
16 years 1 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 ...
135
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
102
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
109
click to vote
SIGPRO
2010
14 years 10 months ago
2010
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...