3
3.0
Jun 30, 2018
06/18
by
Cesare Alippi; Maurizio Bocca; Giacomo Boracchi; Neal Patwari; Manuel Roveri
texts
eye 3
favorite 0
comment 0
RF sensor networks are used to localize people indoor without requiring them to wear invasive electronic devices. These wireless mesh networks, formed by low-power radio transceivers, continuously measure the received signal strength (RSS) of the links. Radio Tomographic Imaging (RTI) is a technique that generates 2D images of the change in the electromagnetic field inside the area covered by the radio transceivers to spot the presence and movements of animates (e.g., people, large animals) or...
Topics: Networking and Internet Architecture, Computing Research Repository, Emerging Technologies
Source: http://arxiv.org/abs/1407.8509
8
8.0
Jun 30, 2018
06/18
by
Lewis P. G. Evans; Niall M. Adams; Christoforos Anagnostopoulos
texts
eye 8
favorite 0
comment 0
In many classification problems unlabelled data is abundant and a subset can be chosen for labelling. This defines the context of active learning (AL), where methods systematically select that subset, to improve a classifier by retraining. Given a classification problem, and a classifier trained on a small number of labelled examples, consider the selection of a single further example. This example will be labelled by the oracle and then used to retrain the classifier. This example selection...
Topics: Machine Learning, Computing Research Repository, Statistics, Learning
Source: http://arxiv.org/abs/1407.8042
4
4.0
Jun 30, 2018
06/18
by
Lin Chen; Nicole Megow; Kevin Schewior
texts
eye 4
favorite 0
comment 0
We consider the online resource minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. We rigorously study this problem and derive various algorithms with small constant competitive ratios for interesting restricted problem variants. As the most important special case, we consider scheduling jobs with agreeable deadlines. We provide the first constant ratio competitive...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1407.7998
3
3.0
Jun 30, 2018
06/18
by
Natasa Djurdjevac Conrad; Ralf Banisch; Christof Schütte
texts
eye 3
favorite 0
comment 0
The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarse-grained description of complex systems, often revealing functional subunits of these systems. A variety of module detection algorithms have been proposed, mostly oriented towards finding hard partitionings of undirected networks. Despite the increasing number of fuzzy clustering methods for directed networks, many of these approaches tend to neglect important...
Topics: Physics, Mathematics, Computing Research Repository, Physics and Society, Probability, Social and...
Source: http://arxiv.org/abs/1407.8039
3
3.0
Jun 30, 2018
06/18
by
Nicolo' Facchi; Francesco Gringoli; Fabio Ricciato; Andrea Toma
texts
eye 3
favorite 0
comment 0
We address the problem of localising a mobile terminal ("blind" node) in unknown position from a set of "anchor" nodes in known positions. The proposed method does not require any form of node synchronisation nor measurement (or control) of the transmission times, which is difficult or anyway costly to achieve in practice. It relies exclusively on reception timestamps collected by the anchor nodes, according to their local clocks, that overhear packets transmitted by the...
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1407.8056
