The easy access to mobile and social networking is changing the way people communicate; however, the deaf person is segregated in some of these media. Although there are many designers working with some recommendations, ...

The Smart City (SC) concept aims to promote dynamic and flexible systems to the cities, that interact with each others and help to maintain the stability and scalability of it’s resources and services, usually through ...

Due to the widespread adoption of distributed systems when building applications, demand for reliability and availability has increased. These properties can be achieved through replication techniques using algorithms that ...

The methodologies currently used by startups for market discovery and software development focus on a more agile and fast development, aiming to obtain learning about the potential market. Often, these methodologies set ...

The Multipath TCP (MPTCP) protocol allows applications to better explore the network resources available to multi-connected devices such as mobile phones or multi-homed systems. Here, some advantages are envisioned: bandwidth ...

No clustering algorithm is guaranteed to find actual groups in any dataset. To deal with this problem, many techniques apply various clustering algorithms to a dataset, generating a set of partitions and assessing them to ...

This work proposes both a study and a development of an algorithm for super-resolution of digital images using projections onto convex sets. The method is based on a classic algorithm for spatial super-resolution which ...

The rapid popularization of smartphones has contributed to the growth of SMS usage as an alternative way of communication. The increasing number of users, along with the trust they inherently have in their devices, makes ...

The super-resolution aims to obtain a higher resolution image, using information from one or more low resolution images. There are different applications where super-resolution may be used, such as medical and forensic ...

The main theme of this dissertation are the k-flow-critical graphs, which are graphs that do not have a k-flow but once any two vertices (either adjacent or not) are identified the smaller graph thus obtained has a k-flow. ...