Sciweavers

551 search results - page 64 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
ECIS
2001
15 years 1 months ago
Avoiding Failure in SPI Initiation
Software Process Improvement (SPI) is a recognised systematic approach for improving the capability of software organisations. Such initiatives have met with a number of difficult...
Pouya Pourkomeylian
WSC
2004
15 years 1 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 13 days ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
STACS
2005
Springer
15 years 5 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
ALT
2007
Springer
15 years 6 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud