This poster reports on current work with the NSF-funded Achievement Standards Network (ASN) to support discovery of educational resources in digital libraries using conceptual grap...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Abstract. This paper’s intention is to present a new approach for decomposing motion trajectories. The proposed algorithm is based on nonnegative matrix factorization, which is a...
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...