46 citations · 99 across the 6 of their papers we have counts for
6 papers
LSTM-Based Predictions for Proactive Information Retrieval
Petri Luukkonen, Markus Koskela, Patrik Floréen
We describe a method for proactive information retrieval targeted at retrieving relevant information during a writing task. In our method, the current task and the needs of the use…
Almost stable matchings in constant time
Patrik Floréen, Petteri Kaski, Valentin Polishchuk +1
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marr…
An optimal local approximation algorithm for max-min linear programs
Patrik Floréen, Joel Kaasinen, Petteri Kaski +1
We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The objective is to maximise subject to , , and …
Local approximation algorithms for a class of 0/1 max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski +1
We study the applicability of distributed, local algorithms to 0/1 max-min LPs where the objective is to maximise subject to ${\sum_v a_{iv} x_v \le 1}…
Tight local approximation results for max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski +1
In a bipartite max-min LP, we are given a bipartite graph $\myG = (V \cup I \cup K, E)$, where each agent is adjacent to exactly one constraint and exactly one…
Approximating max-min linear programs with local algorithms
Patrik Floréen, Petteri Kaski, Topi Musto +1
A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood…