Sciweavers

1074 search results - page 90 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
ICML
2009
IEEE
15 years 4 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
KBSE
2005
IEEE
15 years 3 months ago
Identifying traits with formal concept analysis
Traits are basically mixins or interfaces but with method bodies. In languages that support traits, classes are composed out of traits. There are two main advantages with traits. ...
Adrian Lienhard, Stéphane Ducasse, Gabriela...
COLT
2006
Springer
15 years 1 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
JUCS
2008
122views more  JUCS 2008»
14 years 9 months ago
Using an Evolving Thematic Clustering in a Text Segmentation Process
Abstract: The thematic text segmentation task consists in identifying the most important thematic breaks in a document in order to cut it into homogeneous passages. We propose in t...
Sylvain Lamprier, Tassadit Amghar, Bernard Levrat,...