Sciweavers

2218 search results - page 202 / 444
» Testing Expressibility Is Hard
Sort
View
ENTCS
2007
114views more  ENTCS 2007»
13 years 10 months ago
Parametric Performance Contracts for Software Components with Concurrent Behaviour
Performance prediction methods for component-based software systems aim at supporting design decisions of software architects during early development stages. With the increased a...
Jens Happe, Heiko Koziolek, Ralf Reussner
ML
2006
ACM
13 years 10 months ago
Relational IBL in classical music
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
Asmir Tobudic, Gerhard Widmer
PC
2006
103views Management» more  PC 2006»
13 years 10 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
TKDE
2008
126views more  TKDE 2008»
13 years 10 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...
TLT
2008
77views more  TLT 2008»
13 years 10 months ago
The Scalable Adapter Design Pattern: Enabling Interoperability Between Educational Software Tools
For many practical learning scenarios, the integrated use of more than one learning tool is educationally beneficial. In these cases, interoperability between learning tools--getti...
Andreas Harrer, Niels Pinkwart, Bruce M. McLaren, ...