Sciweavers

199 search results - page 35 / 40
» Intensional Positive Set Theory
Sort
View
WWW
2008
ACM
14 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
WWW
2010
ACM
14 years 2 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
PRL
2007
108views more  PRL 2007»
13 years 7 months ago
Towards a measure of deformability of shape sequences
In this paper we develop a theory for characterizing how deformable a shape is given a sequence of its observations. We define a term called ‘‘deformability index’’ (DI) ...
Amit K. Roy Chowdhury
ATAL
2005
Springer
14 years 1 months ago
Decentralized voting with unconditional privacy
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
Felix Brandt, Tuomas Sandholm