Sciweavers

6142 search results - page 918 / 1229
» The Complexity of Partition Functions
Sort
View
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
16 years 1 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain
PPDP
2009
Springer
16 years 1 months ago
Future contracts
Many recent research projects focus on language support for behavioral software contracts, that is, assertions that govern the boundaries between software building blocks such as ...
Christos Dimoulas, Riccardo Pucella, Matthias Fell...
FDG
2009
ACM
16 years 1 months ago
Emphasizing soft skills and team development in an educational digital game design course
Engineering education has evolved from providing students solely with technical skills to providing them with courses that provide students with the non-technical “soft skillsâ€...
Quincy Brown, Frank J. Lee, Suzanne Alejandre
ISSTA
2009
ACM
16 years 1 months ago
Specifying the worst case: orthogonal modeling of hardware errors
During testing, the execution of valid cases is only one part of the task. Checking the behavior in boundary situations and in the presence of errors is an equally important subje...
Jewgenij Botaschanjan, Benjamin Hummel
IWCMC
2009
ACM
16 years 1 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach