We propose a new data structure for manipulating graphs, called -graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each ...

Due to the inability of GPS (or other GNSS methods) to provide satisfactory precision for the indoor location scenario, indoor positioning systems resort to other signals already available on site, typically Wi-Fi given ...

We present a full description of the nonergodic properties of wave functions on random graphs without boundary in the localized and critical regimes of the Anderson transition. We find that they are characterized by two ...

Recommendation engines (RE) are becoming highly popular, e.g., in the area of e-commerce. A RE offers new items (products or content) to users based on their profile and historical data. The most popular algorithms used ...

Software maintenance is costly for developers and customers as well. In this regard, new ideas and technologies are necessary to minimize the effort in this type of activity. This dissertation presents MITRAS project, an ...