: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Interpretation and Low-Level Code Optimization Saumya Debray Department of Computer Science University of Arizona Tucson, AZ 85715 Abstract interpretation is widely accepted as a ...
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
Francisco Gomez-Martin, Perouz Taslakian, Godfried...
This paper studies a tuned version of an induction tree which is used for automatic detection of lexical word category. The database used to train the tree has several fields to de...