Sciweavers

327 search results - page 57 / 66
» Algorithms for infinite huffman-codes
Sort
View
FSTTCS
2010
Springer
13 years 4 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
JMLR
2010
128views more  JMLR 2010»
13 years 1 months ago
Fluid Dynamics Models for Low Rank Discriminant Analysis
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
Yung-Kyun Noh, Byoung-Tak Zhang, Daniel D. Lee
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 7 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
ASE
2005
137views more  ASE 2005»
13 years 6 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
POPL
2010
ACM
14 years 4 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno