Sciweavers

1389 search results - page 93 / 278
» Lightweight dependent classes
Sort
View
RTA
2004
Springer
14 years 3 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
ICGI
1998
Springer
14 years 1 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
CAV
2009
Springer
165views Hardware» more  CAV 2009»
14 years 1 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
COLT
2007
Springer
14 years 1 months ago
Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector
We study generalized bootstrapped confidence regions for the mean of a random vector whose coordinates have an unknown dependence structure, with a non-asymptotic control of the co...
Sylvain Arlot, Gilles Blanchard, Étienne Ro...
KDD
1995
ACM
95views Data Mining» more  KDD 1995»
14 years 1 months ago
On Subjective Measures of Interestingness in Knowledge Discovery
One of the central problems in the field of knowledge discovery is the development of good measures of interestingness of discovered patterns. Such measures of interestingness are...
Abraham Silberschatz, Alexander Tuzhilin