9842 search results - page 192 / 1969 » The Complexity of the Matching-Cut Problem |
TOOLS
1999
IEEE
14 years 2 months ago
1999
IEEE
The evolution of software systems over many years often leads to unnecessarily complex and in exible designs which in turn lead to a huge amount of e ort for enhancements and main...
HPCN
1995
Springer
14 years 1 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
COCO
2008
Springer
14 years 5 days ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
JMLR
2006
13 years 10 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...