Sciweavers

81 search results - page 12 / 17
» The Power and Performance of Proof Animation
Sort
View
GOSLER
1995
13 years 11 months ago
A Guided Tour Across the Boundaries of Learning Recursive Languages
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
Thomas Zeugmann, Steffen Lange
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 7 months ago
Capacity of the Discrete-Time AWGN Channel Under Output Quantization
We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. W...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 7 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
INFORMS
2007
123views more  INFORMS 2007»
13 years 7 months ago
Constructing Ensembles from Data Envelopment Analysis
It has been shown in prior work in management science, statistics and machine learning that using an ensemble of models often results in better performance than using a single ‘...
Zhiqiang Zheng, Balaji Padmanabhan
ICS
2009
Tsinghua U.
14 years 2 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell