Publications related to Electricity Theft Detection Using Dynamic Graph Construction and Graph Attention Network

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Privacy of Real-Time Pricing in Smart Grid

Maryam Kamgarpour, Christos Dimitrakakis

Installing smart meters to publish real-time electricity rates has been controversial while it might lead to privacy concerns. Dispatched rates include fine-grained data on aggregate electricity consumption in a zone and could potentially be used to infer ...

IEEE2019

On the Rainbow Turan number of paths

Abhishek Methuku

Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic ...

ELECTRONIC JOURNAL OF COMBINATORICS2019

Spectral MAB for Unknown Graph Processes

Pascal Frossard, Laura Toni

In this work, we study graph-based multi-arms bandit (MAB) problems aimed at optimizing actions on irregular and high-dimensional graphs. More formally, we consider a decision-maker that takes sequential actions over time and observes the experienced rewar ...

IEEE Computer Society2018

The Sketching Complexity of Graph and Hypergraph Counting

Mikhail Kapralov, John Michael Goddard Kallaugher

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been ...

IEEE COMPUTER SOC2018

An Event-driven Low Power Electronics for Loads Metering and Control in Smart Buildings

Maher Kayal, Georgios Lilis, Gilbert Didier Francis Conus, Nastaran Asadi Zanjani

The Internet of Things market is experiencing a period of intense growth. From 7 to 10 billion of connected devices in 2013, it is expected to reach 26 to 30 billion in 2020. Smart buildings represent between 2 to 21% of this market. Indeed, the possibilit ...

Ieee2016

On random subgraphs of Kneser and Schrijver graphs

Andrei Kupavskii

A Kneser graph KG(n,k) is a graph whose vertices are in oneto-one correspondence with k -element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lowisz states that the chromatic num ...

Academic Press Inc Elsevier Science2016

Chaos: Scale-out Graph Processing from Secondary Storage

Willy Zwaenepoel, Laurent Bindschaedler, Amitabha Roy, Jasmina Malicevic

Chaos scales graph processing from secondary storage to multiple machines in a cluster. Earlier systems that process graphs from secondary storage are restricted to a single ma- chine, and therefore limited by the bandwidth and capacity of the storage syst ...

2015

Scale-up Graph Processing in the Cloud: Challenges and Solutions

Willy Zwaenepoel, Amitabha Roy, Jasmina Malicevic

Processing large graphs is an important part of the big-data problem. Recently a number of scale-up systems such as X-Stream, Graphchi and Turbograph have been proposed for processing large graphs using secondary storage on a single machine. The design and ...

Electricity Theft Detection Using Dynamic Graph Construction and Graph Attention Network

Graph Chatbot

Chat with Graph Search

Privacy of Real-Time Pricing in Smart Grid

On the Rainbow Turan number of paths

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Generalized Turan Problems For Even Cycles

Spectral MAB for Unknown Graph Processes

The Sketching Complexity of Graph and Hypergraph Counting

An Event-driven Low Power Electronics for Loads Metering and Control in Smart Buildings

On random subgraphs of Kneser and Schrijver graphs

Chaos: Scale-out Graph Processing from Secondary Storage

Scale-up Graph Processing in the Cloud: Challenges and Solutions

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

On the Rainbow Turan number of paths

Chaos: Scale-out Graph Processing from Secondary Storage

The Sketching Complexity of Graph and Hypergraph Counting

Privacy of Real-Time Pricing in Smart Grid

Generalized Turan Problems For Even Cycles

Spectral MAB for Unknown Graph Processes

An Event-driven Low Power Electronics for Loads Metering and Control in Smart Buildings

On random subgraphs of Kneser and Schrijver graphs

Scale-up Graph Processing in the Cloud: Challenges and Solutions