textOur unprecedented capacity for data generation and acquisition often reaches the limits of our data storage capabilities. Situations when data are generated faster or at a greater volume than can be stored demand a streaming approach. Memory is an even more valuable resource. Algorithms that use more memory than necessary can pose bottlenecks when processing high-dimensional data and the need for memory-efficient algorithms is especially stressed in the streaming setting. Finally, network along with storage, emerge as the critical bottlenecks in the context of distributed computation. These computational constraints spell out a demand for efficient tools that guarantee a solution in the face of limited resources, even when the data is v...
As the size of data available for processing increases, new models of computation are needed. This ...
In this thesis, we study the power and limit of algorithms on various models, aiming at applications...
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communit...
textOur unprecedented capacity for data generation and acquisition often reaches the limits of our d...
The field of streaming algorithms has enjoyed a deal of focus from the theoretical computer science ...
Extracting knowledge by performing computations on graphs is becoming increasingly challenging as gr...
Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present nu...
International audienceWe introduce a novel algorithm to perform graph clustering in the edge streami...
Graphics Processing Units (GPUs) have been used successfully for accelerating a wide variety of appl...
The effectiveness of machine learning (ML) in today's applications largely depends on the goodness o...
AbstractIn this paper we show how parallel algorithms can be turned into efficient streaming algorit...
Machine learning algorithms are now being deployed in practically all areas of our lives. Part of th...
Graph Convolutional Networks (GCNs) are extensively utilized for deep learning on graphs. The large ...
Research areas: Graph mining algorithmsLarge graphs with billions of nodes and edges are increasingl...
Reducing communication is an important objective, as it can save energy or improve the performance o...
As the size of data available for processing increases, new models of computation are needed. This ...
In this thesis, we study the power and limit of algorithms on various models, aiming at applications...
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communit...
textOur unprecedented capacity for data generation and acquisition often reaches the limits of our d...
The field of streaming algorithms has enjoyed a deal of focus from the theoretical computer science ...
Extracting knowledge by performing computations on graphs is becoming increasingly challenging as gr...
Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present nu...
International audienceWe introduce a novel algorithm to perform graph clustering in the edge streami...
Graphics Processing Units (GPUs) have been used successfully for accelerating a wide variety of appl...
The effectiveness of machine learning (ML) in today's applications largely depends on the goodness o...
AbstractIn this paper we show how parallel algorithms can be turned into efficient streaming algorit...
Machine learning algorithms are now being deployed in practically all areas of our lives. Part of th...
Graph Convolutional Networks (GCNs) are extensively utilized for deep learning on graphs. The large ...
Research areas: Graph mining algorithmsLarge graphs with billions of nodes and edges are increasingl...
Reducing communication is an important objective, as it can save energy or improve the performance o...
As the size of data available for processing increases, new models of computation are needed. This ...
In this thesis, we study the power and limit of algorithms on various models, aiming at applications...
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communit...