Publications related to Breadth-first search

Transition from Vertical to Lateral Diking at the Neutral Buoyancy Line

Brice Tanguy Alphonse Lecampion, Andreas Möri, Dmitriy Garagash

Buoyant hydraulic fractures (HF) are a viable approach to model propagating magmatic intrusions in the lithosphere. Solutions for fully planar three-dimensional (3D) HF suggest the existence of a family of solutions as a function of fluid and solid propert ...

2023

Sketches, metrics and fast algorithms

Navid Nouri

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec, Olivier Ruas

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021

NICEpath: Finding metabolic pathways in large networks through atom-conserving substrate-product pairs

Vassily Hatzimanikatis, Jasmin Maria Hafner

Motivation: Finding biosynthetic pathways is essential for metabolic engineering of organisms to produce chemicals, biodegradation prediction of pollutants and drugs, and for the elucidation of bioproduction pathways of secondary metabolites. A key step in ...

OXFORD UNIV PRESS2021

Horizontal side-channel full key recovery on ephemeral SIKE

Natacha Yolande Emmanuel Marie Linard de Guertechin, Aymeric Genet, Novak Kaluderovic

This paper describes the first practical single-trace side-channel power analysis of SIKE. The attack exploits the nature of elliptic curve point addition formulas which require the same function to be executed multiple times. We target the three point lad ...

2021

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

Kernel Density Estimation through Density Constrained Near Neighbor Search

Mikhail Kapralov, Navid Nouri

In this paper we revisit the kernel density estimation problem: given a kernel K(x, y) and a dataset of n points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query q, a (1 + epsilon)-approximation to mu := ...

IEEE2020

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Exploring Citation Networks to Study Intertextuality in Classics

Matteo Romanello

Referring constitutes such an essential scholarly activity across disciplines that it has been regarded by [Unsworth 2000] as one of the scholarly primitives. In Classics, in particular, the references to passages of the ancient texts - the so-called canon ...

Alliance Digital Humanities Organizations2016

Breadth-first search

Graph Chatbot

Chat with Graph Search

Transition from Vertical to Lateral Diking at the Neutral Buoyancy Line

Sketches, metrics and fast algorithms

Cluster-and-Conquer: When Randomness Meets Graph Locality

NICEpath: Finding metabolic pathways in large networks through atom-conserving substrate-product pairs

Horizontal side-channel full key recovery on ephemeral SIKE

Sublinear Algorithms for Spectral Graph Clustering

Kernel Density Estimation through Density Constrained Near Neighbor Search

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Exploring Citation Networks to Study Intertextuality in Classics

Transition from Vertical to Lateral Diking at the Neutral Buoyancy Line

Horizontal side-channel full key recovery on ephemeral SIKE

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Exploring Citation Networks to Study Intertextuality in Classics

Sketches, metrics and fast algorithms

Sublinear Algorithms for Spectral Graph Clustering

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Cluster-and-Conquer: When Randomness Meets Graph Locality

NICEpath: Finding metabolic pathways in large networks through atom-conserving substrate-product pairs

Kernel Density Estimation through Density Constrained Near Neighbor Search