Sciweavers

2080 search results - page 19 / 416
» Measuring empirical computational complexity
Sort
View
JMLR
2008
148views more  JMLR 2008»
13 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
KSEM
2009
Springer
14 years 4 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
SIGSOFT
2012
ACM
12 years 5 months ago
Report from the 2nd international workshop on replication in empirical software engineering research (RESER 2011)
The RESER workshop provides a venue in which empirical software engineering researchers can discuss the theoretical foundations and methods of replication, as well as present the ...
Jonathan L. Krein, Charles D. Knutson, Lutz Preche...
ISVC
2010
Springer
13 years 8 months ago
Reconstruction of Spectra Using Empirical Basis Functions
Physically-based image synthesis requires measured spectral quantities for illuminants and reflectances as part of the virtual scene description to compute trustworthy lighting si...
Jakob Bärz, Tina Hansen, Stefan Müller
VL
2002
IEEE
110views Visual Languages» more  VL 2002»
14 years 2 months ago
Empirical Evidence that Algorithm Animation Promotes Understanding of Distributed Algorithms
Previous studies of program visualization have generally failed to provide convincing support for the benefits of algorithm animation in promoting the understanding of computatio...
Mihail Eduard Tudoreanu, Rong Wu, Ashley Hamilton-...