Sciweavers

1816 search results - page 26 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
TASLP
2010
78views more  TASLP 2010»
14 years 6 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
FSS
2008
110views more  FSS 2008»
14 years 12 months ago
Learning valued preference structures for solving classification problems
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
Eyke Hüllermeier, Klaus Brinker
IJCAI
1989
15 years 29 days ago
Reconstructive Explanation: Explanation as Complex Problem Solving
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
Michael R. Wick, William B. Thompson
FOCS
1995
IEEE
15 years 3 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ICALP
2009
Springer
16 years 3 days ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...