Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian...
Queries on software artifacts play an important role in novel software development approaches, such as Aspect-Oriented Software Development and OMG's Model Driven Architecture...
Abstract. In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linea...
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
Abstract. This paper provides a survey of searchable, peer-to-peer filesharing systems that offer the user some form of anonymity. We start this survey by giving a brief descript...