activity
20082023
most citedEfficient Stepwise Selection in Decomposable Models

64 citations · 64 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DB2023

OmniSketch: Efficient Multi-Dimensional High-Velocity Stream Analytics with Arbitrary Predicates

Wieger R. Punter, Odysseas Papapetrou, Minos Garofalakis

A key need in different disciplines is to perform analytics over fast-paced data streams, similar in nature to the traditional OLAP analytics in relational databases i.e., with fil…

cs.CR2021

Improved Pan-Private Stream Density Estimation

Vassilis Digalakis, George N. Karystinos, Minos N. Garofalakis

Differential privacy is a rigorous definition for privacy that guarantees that any analysis performed on a sensitive dataset leaks no information about the individuals whose data a…

cs.DB2014

Multi-Resource Parallel Query Scheduling and Optimization

Minos Garofalakis, Yannis Ioannidis

Scheduling query execution plans is a particularly complex problem in shared-nothing parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) o…

cs.AI2013★ 64 cited

Efficient Stepwise Selection in Decomposable Models

Amol Deshpande, Minos Garofalakis, Michael I. Jordan

In this paper, we present an efficient way of performing stepwise selection in the class of decomposable models. The main contribution of the paper is a simple characterization of…

cs.DB2012

Sketch-based Querying of Distributed Sliding-Window Data Streams

Odysseas Papapetrou, Minos Garofalakis, Antonios Deligiannakis

While traditional data-management systems focus on evaluating single, ad-hoc queries over static data sets in a centralized setting, several emerging applications require (possibly…

cs.DB2011

Large-Scale Collective Entity Matching

Vibhor Rastogi, Nilesh Dalvi, Minos Garofalakis

There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being appl…