142 search results - page 10 / 29 » Approximate maximum weight branchings |
78
Voted
CP
2008
Springer
14 years 11 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
89
Voted
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
A normalized, power-weighted averaging filter (NPF) is a very good approximation to the well-know local maximum and minimum filters along the object edges and offers noise reducti...
86
Voted
VTC
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract— In frequency division duplex transceivers the transmit signal is leaking through the duplexer into the receive branch. For the case of Zero-IF receivers the nonlinearit...
81
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...