— In this paper, we introduce and evaluate novel adaptive schemes for neighbor discovery in Bluetooth-enabled ad-hoc networks. In an ad-hoc peer-to-peer setting, neighbor search ...
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...