Sciweavers

934 search results - page 78 / 187
» A theoretical analysis of the HIFF problem
Sort
View
SYNTHESE
2008
84views more  SYNTHESE 2008»
14 years 9 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
LOPSTR
2004
Springer
15 years 3 months ago
A Generic Framework for Context-Sensitive Analysis of Modular Programs
Abstract. Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in or...
Germán Puebla, Jesús Correas, Manuel...
SIGGRAPH
1992
ACM
15 years 1 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
15 years 10 months ago
Supervised probabilistic principal component analysis
Principal component analysis (PCA) has been extensively applied in data mining, pattern recognition and information retrieval for unsupervised dimensionality reduction. When label...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
FCA
2005
Springer
188views Formal Methods» more  FCA 2005»
15 years 3 months ago
Formal Concept Analysis-Based Class Hierarchy Design in Object-Oriented Software Development
The class hierarchy is an important aspect of object-oriented software development. Design and maintenance of such a hierarchy is a difficult task that is often accomplished witho...
Robert Godin, Petko Valtchev