Catalogo dei prodotti della ricerca

MALVESTUTO, Francesco Mario
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.573
EU - Europa 461
AS - Asia 195
SA - Sud America 30
AF - Africa 5
Totale 3.264
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.559
UA - Ucraina 197
IN - India 130
FI - Finlandia 71
SE - Svezia 67
IT - Italia 66
SG - Singapore 35
AR - Argentina 30
CN - Cina 30
GB - Regno Unito 21
CA - Canada 13
DE - Germania 11
BE - Belgio 9
IE - Irlanda 8
CH - Svizzera 4
ZA - Sudafrica 3
FR - Francia 2
NL - Olanda 2
MX - Messico 1
NO - Norvegia 1
RO - Romania 1
RU - Federazione Russa 1
SC - Seychelles 1
TG - Togo 1
Totale 3.264
Salva come PNG Salva come JPEG
Città #
Fairfield 389
Woodbridge 288
Chandler 233
Houston 195
Ann Arbor 163
Seattle 153
Ashburn 147
Wilmington 131
Cambridge 123
Jacksonville 83
Princeton 71
Plano 70
Millbury 42
Des Moines 40
Rome 38
Boston 34
Federal 30
Beijing 27
San Diego 25
Singapore 20
San Paolo di Civitate 15
Andover 13
Lawrence 13
Norwalk 13
Boardman 12
Toronto 10
Brussels 9
Dublin 8
Bühl 7
Falls Church 5
Auburn Hills 4
Bern 4
Los Angeles 4
Dearborn 3
Laurel 3
Philadelphia 3
Phoenix 3
Arzignano 2
New York 2
Ottawa 2
Redmond 2
Atlanta 1
Guangzhou 1
Indiana 1
Leawood 1
Lomé 1
London 1
Mannheim 1
Modderfontein 1
Montréal 1
Muizenberg 1
Nanchang 1
Nanjing 1
Oslo 1
Ruvo Di Puglia 1
San Mateo 1
Secaucus 1
Silverton 1
Simi Valley 1
Stockholm 1
Totale 2.458
Salva come PNG Salva come JPEG
Nome #
Query evaluability in statistical databases 96
A universal-table model for categorical databases 87
A universal-scheme approach to statistical databases containing homogeneous summary tables 81
A hypergraph-theoretic analysis of collapsibility and decomposability in extended log-linear models 76
Existence of extensions and product extensions for discrete probability distributions 75
A unique formal system for binary decompositions of database relations, probability distributions, and graphs 72
An axiomatization of loglinear models with an application to the model-search problem 72
Decomposability of abstract and path-induced convexities in hypergraphs 69
Auditing categorical Sum, Max and Min queries 68
Statistical versus relational join dependencies 67
Comment on: A unique formal system for binary decompositions of database relations, probability distributions, and graphs 66
Erratum: Equivalence of compositional expressions and independence relations in compositional models 66
Statistical treatment of the information content of a database 65
Approximating discrete probability distributions with decomposable models 65
Canonical and monophonic convexities in hypergraphs 64
The derivation problem for summary data 64
Marginalization in models generated by compositional expressions 63
An implementation of the Iterative Proportional Fitting Procedure by propagation trees 62
Auditing sum-queries to make a statistical database secure 60
A linear algorithm for finding the invariant edges of an edge-weighted graph 60
Minimal invariant sets in a vertex-weighted graph 58
Modelling large bases of categorical data with acyclic schemes 57
A fast algorithm for query optimization in Universal Relation databases 57
Answering queries in categorical data bases 55
Decomposition of a hypergraph by partial-edge separators 55
Decomposable convexities in graphs and hypergraphs 55
A fast algorithm for query optimization in universal-relation databases 54
Theory of random observables in relational data bases 54
Two classes of graphs in which some problems related to convexity are efficiently solvable 54
Equivalence of compositional expressions and independence relations in compositional models 52
Privacy in Multidimensional Databases 52
Probabilistic independence and graphical properties 52
TREE AND LOCAL COMPUTATIONS IN A CROSS-ENTROPY MINIMIZATION PROBLEM WITH MARGINAL CONSTRAINTS 51
A complete axiomatization of full acyclic join dependencies 51
An analytical approach to the inference of summary data of additive type 49
Recognizing submodels of a loglinear model 48
Computing a simple decomposable model from any interaction model 46
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type 46
Computing the maximum-entropy extension of discrete probability distributions 45
Query evaluability in statistical databases 45
Formal theories of probabilistic dependency models 44
Testing implication of loglinear hierarchical models for probability distributions 43
Customized answers to summary queries via aggregate views 42
Searching for a simple log-linear model fitting a discrete probability distribution 41
Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent 41
Computational issues connected with the protection of sensitive statistics by auditing sum queries 39
Censoring statistical tables to protect sensitive information: easy and hard problems 38
Computing marginals in graphical log-linear models 35
Data integration in statistical databases 35
Auditing Sum Queries 33
A join-like operator to combine data cubes and answer qqueries from multiple data cubes 32
From conditional independences to decomposable models and beyond 31
Aggregate evaluability in statistical databases 30
On the implication problem for factorizations of discrete probability distributions 29
From conditional independences to factorization constraints with discrete random variables 28
Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table 27
Local computation of answers to table queries on summary databases 27
From the semigraphoid of conditional independences to the hypergraphoid of no-interaction relations 26
Computing simple-path convex hulls in hypergraphs 26
An audit expert for large statistical databases 25
Sull’insostenibile sicurezza statistica delle basi di dati 24
Query processing in probabilistic data bases 23
Formal treatment of interaction models for probability distributions 22
A BACKWARD SELECTION PROCEDURE FOR APPROXIMATING A DISCRETE PROBABILITY DISTRIBUTION BY DECOMPOSABLE MODELS 20
Decomposing complex contingency tables to reduce storage requirements 18
Derivation DAGs for inferring interaction models 18
The sum-product algorithm: Algebraic independence and computational aspects 17
Graphical algorithms for interaction models 16
Suppressing marginal totals from a two-dimensional table to protect sensitive information 15
On the hardness of protecting sensitive information in a statistical database 12
La ricerca operativa nella progettazione delle basi di dati statistici 10
Totale 3.301
Salva come PNG Salva come JPEG
Categoria #
all - tutte 7.505
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 7.505
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019299 0 0 0 0 0 0 0 0 0 0 175 124
2019/2020835 136 40 15 50 85 89 89 107 91 65 44 24
2020/2021263 39 46 9 22 5 24 2 31 14 46 23 2
2021/2022629 3 30 52 8 100 9 7 70 68 59 33 190
2022/2023590 127 69 44 48 83 100 0 42 63 1 12 1
2023/2024123 12 42 7 7 4 0 1 2 0 38 10 0
Totale 3.301