Sciweavers

52 search results - page 5 / 11
» Generalizing the Paige-Tarjan algorithm by abstract interpre...
Sort
View
ICFP
2006
ACM
14 years 8 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
TFS
2008
230views more  TFS 2008»
13 years 8 months ago
SGERD: A Steady-State Genetic Algorithm for Extracting Fuzzy Classification Rules From Data
Abstract--This paper considers the automatic design of fuzzyrule-based classification systems from labeled data. The performance of classifiers and the interpretability of generate...
Eghbal G. Mansoori, Mansoor J. Zolghadri, Seraj D....
TSP
2011
151views more  TSP 2011»
13 years 3 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
POPL
1996
ACM
14 years 22 days ago
A Practical and Flexible Flow Analysis for Higher-Order Languages
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
J. Michael Ashley
CSL
2009
Springer
14 years 3 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer