Sciweavers

9736 search results - page 73 / 1948
» How Fast Can We Compute Products
Sort
View
MST
2007
168views more  MST 2007»
15 years 4 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
SGP
2007
15 years 7 months ago
Example-based skeleton extraction
We present a method for extracting a hierarchical, rigid skeleton from a set of example poses. We then use this skeleton to not only reproduce the example poses, but create new de...
Scott Schaefer, Can Yuksel
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 11 months ago
Fast computation of frequency response functions for a class of nonlinear systems
— One of the important and efficient tools in system analysis is the analysis of responses to harmonic excitations. For linear systems the information on such responses is conta...
Alexey V. Pavlov, Nathan van de Wouw
DIS
2007
Springer
15 years 10 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
SPLC
2010
15 years 3 months ago
Software Product Line Engineering for Long-Lived, Sustainable Systems
The design and operation of long-lived, sustainable systems (LSS) are hampered by limited support for change over time and limited preservation of system knowledge. The solution we...
Robyn R. Lutz, David Weiss, Sandeep Krishnan, Jing...