Catalogo dei prodotti della ricerca

MALVESTUTO, Francesco Mario
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.575
EU - Europa 469
AS - Asia 264
SA - Sud America 30
AF - Africa 5
Totale 3.343
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.561
UA - Ucraina 197
IN - India 130
SG - Singapore 104
FI - Finlandia 71
SE - Svezia 67
IT - Italia 66
AR - Argentina 30
CN - Cina 30
GB - Regno Unito 21
DE - Germania 16
CA - Canada 13
BE - Belgio 9
IE - Irlanda 8
CH - Svizzera 4
AT - Austria 3
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.343
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
Singapore 54
Millbury 42
Des Moines 40
Rome 38
Boston 34
Federal 30
Beijing 27
San Diego 25
San Paolo di Civitate 15
Andover 13
Lawrence 13
Norwalk 13
Boardman 12
Toronto 10
Brussels 9
Dublin 8
Bühl 7
Mannheim 6
Falls Church 5
Auburn Hills 4
Bern 4
Los Angeles 4
Dearborn 3
Laurel 3
Linz 3
Philadelphia 3
Phoenix 3
Arzignano 2
New York 2
Ottawa 2
Redmond 2
Atlanta 1
Forest City 1
Guangzhou 1
Indiana 1
Leawood 1
Lomé 1
London 1
Modderfontein 1
Montréal 1
Muizenberg 1
Nanchang 1
Nanjing 1
Oslo 1
Ruvo Di Puglia 1
San Mateo 1
Sandston 1
Secaucus 1
Silverton 1
Simi Valley 1
Stockholm 1
Totale 2.502
Salva come PNG Salva come JPEG
Nome #
Query evaluability in statistical databases 98
A universal-table model for categorical databases 88
A universal-scheme approach to statistical databases containing homogeneous summary tables 84
A hypergraph-theoretic analysis of collapsibility and decomposability in extended log-linear models 77
Existence of extensions and product extensions for discrete probability distributions 76
A unique formal system for binary decompositions of database relations, probability distributions, and graphs 73
An axiomatization of loglinear models with an application to the model-search problem 73
Decomposability of abstract and path-induced convexities in hypergraphs 69
Statistical versus relational join dependencies 68
Auditing categorical Sum, Max and Min queries 68
Comment on: A unique formal system for binary decompositions of database relations, probability distributions, and graphs 67
Erratum: Equivalence of compositional expressions and independence relations in compositional models 67
Statistical treatment of the information content of a database 66
The derivation problem for summary data 66
Canonical and monophonic convexities in hypergraphs 65
Approximating discrete probability distributions with decomposable models 65
Marginalization in models generated by compositional expressions 64
An implementation of the Iterative Proportional Fitting Procedure by propagation trees 63
A linear algorithm for finding the invariant edges of an edge-weighted graph 61
Auditing sum-queries to make a statistical database secure 60
Minimal invariant sets in a vertex-weighted graph 59
Answering queries in categorical data bases 58
Modelling large bases of categorical data with acyclic schemes 57
Decomposition of a hypergraph by partial-edge separators 57
Decomposable convexities in graphs and hypergraphs 57
A fast algorithm for query optimization in Universal Relation databases 57
Theory of random observables in relational data bases 55
Two classes of graphs in which some problems related to convexity are efficiently solvable 55
A fast algorithm for query optimization in universal-relation databases 54
Privacy in Multidimensional Databases 53
Probabilistic independence and graphical properties 53
Equivalence of compositional expressions and independence relations in compositional models 52
A complete axiomatization of full acyclic join dependencies 52
TREE AND LOCAL COMPUTATIONS IN A CROSS-ENTROPY MINIMIZATION PROBLEM WITH MARGINAL CONSTRAINTS 51
Recognizing submodels of a loglinear model 49
An analytical approach to the inference of summary data of additive type 49
Computing the maximum-entropy extension of discrete probability distributions 47
Computing a simple decomposable model from any interaction model 47
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type 47
Query evaluability in statistical databases 46
Formal theories of probabilistic dependency models 45
Testing implication of loglinear hierarchical models for probability distributions 44
Customized answers to summary queries via aggregate views 43
Searching for a simple log-linear model fitting a discrete probability distribution 42
Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent 42
Computational issues connected with the protection of sensitive statistics by auditing sum queries 40
Data integration in statistical databases 40
Censoring statistical tables to protect sensitive information: easy and hard problems 38
Computing marginals in graphical log-linear models 37
Auditing Sum Queries 35
From conditional independences to decomposable models and beyond 33
On the implication problem for factorizations of discrete probability distributions 32
Aggregate evaluability in statistical databases 32
A join-like operator to combine data cubes and answer qqueries from multiple data cubes 32
Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table 28
Local computation of answers to table queries on summary databases 28
From conditional independences to factorization constraints with discrete random variables 28
From the semigraphoid of conditional independences to the hypergraphoid of no-interaction relations 27
Computing simple-path convex hulls in hypergraphs 27
An audit expert for large statistical databases 26
Query processing in probabilistic data bases 25
Sull’insostenibile sicurezza statistica delle basi di dati 25
Formal treatment of interaction models for probability distributions 23
Decomposing complex contingency tables to reduce storage requirements 20
A BACKWARD SELECTION PROCEDURE FOR APPROXIMATING A DISCRETE PROBABILITY DISTRIBUTION BY DECOMPOSABLE MODELS 20
The sum-product algorithm: Algebraic independence and computational aspects 19
Derivation DAGs for inferring interaction models 18
Graphical algorithms for interaction models 17
Suppressing marginal totals from a two-dimensional table to protect sensitive information 16
On the hardness of protecting sensitive information in a statistical database 14
La ricerca operativa nella progettazione delle basi di dati statistici 11
Totale 3.380
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.056
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 8.056
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/2024166 12 42 7 7 4 0 1 2 0 38 17 36
2024/202536 36 0 0 0 0 0 0 0 0 0 0 0
Totale 3.380