Sciweavers

478 search results - page 19 / 96

» Monads of Regular Theories

130

FOCS
1992
IEEE

135views Theoretical Computer Science» more FOCS 1992»

Back to the Future: Towards a Theory of Timed Regular Languages

15 years 10 months ago

Back to the Future: Towards a Theory of Timed Regular Languages

Download www.cs.berkeley.edu

Rajeev Alur, Thomas A. Henzinger

claim paper

Read More »

125

ANCS
2008
ACM

112views Computer Networks» more ANCS 2008»

Efficient regular expression evaluation: theory to practice

15 years 8 months ago

Efficient regular expression evaluation: theory to practice

Download www.arl.wustl.edu

Michela Becchi, Patrick Crowley

claim paper

Read More »

101

JC
2007

62views more JC 2007»

On regularization algorithms in learning theory

15 years 6 months ago

On regularization algorithms in learning theory

Download web.mit.edu

Frank Bauer, Sergei V. Pereverzev, Lorenzo Rosasco

claim paper

Read More »

118

NECO
2002

80views more NECO 2002»

On Different Facets of Regularization Theory

15 years 5 months ago

On Different Facets of Regularization Theory

Download yaroslavvb.com

Zhe Chen, Simon Haykin

claim paper

Read More »

172

POPL
2012
ACM

275views Programming Languages» more POPL 2012»

Algebraic foundations for effect-dependent optimisations

14 years 1 months ago

Algebraic foundations for effect-dependent optimisations

Download homepages.inf.ed.ac.uk

We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...

Ohad Kammar, Gordon D. Plotkin

claim paper

Read More »

« Prev « First page 19 / 96 Last » Next »