Sciweavers

11160 search results - page 199 / 2232
» Incompleteness in a General Setting
Sort
View
LISP
2006
117views more  LISP 2006»
15 years 4 months ago
About permutation algebras, (pre)sheaves and named sets
In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)...
Fabio Gadducci, Marino Miculan, Ugo Montanari
PAMI
2008
162views more  PAMI 2008»
15 years 3 months ago
Dimensionality Reduction of Clustered Data Sets
We present a novel probabilistic latent variable model to perform linear dimensionality reduction on data sets which contain clusters. We prove that the maximum likelihood solution...
Guido Sanguinetti
RSA
2008
63views more  RSA 2008»
15 years 3 months ago
On the size of the algebraic difference of two random Cantor sets
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
Michel Dekking, Károly Simon
ISCI
2007
116views more  ISCI 2007»
15 years 4 months ago
Advances in type-2 fuzzy sets and systems
In this state-of-the-art paper, important advances that have been made during the past five years for both general and interval type-2 fuzzy sets and systems are described. Inter...
Jerry M. Mendel
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 2 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff