Sciweavers

478 search results - page 27 / 96
» Monads of Regular Theories
Sort
View
73
Voted
ICIP
2007
IEEE
15 years 5 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura
76
Voted
POPL
2010
ACM
15 years 8 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
80
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 11 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
71
Voted
JFP
2008
61views more  JFP 2008»
14 years 11 months ago
Control reduction theories: the benefit of structural substitution
The historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for ...
Zena M. Ariola, Hugo Herbelin
CORR
2002
Springer
113views Education» more  CORR 2002»
14 years 10 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...