We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Fighting global security threats with only a local view is inherently difficult. Internet network operators need to fight global phenomena such as botnets, but they are hampered...
Jason Reed, Adam J. Aviv, Daniel Wagner, Andreas H...
Typically, case-based recommender systems recommend single items to the on-line customer. In this paper we introduce the idea of recommending a user-defined collection of items whe...
Conor Hayes, Paolo Avesani, Emiliano Baldo, Padrai...
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
Guido Reina, Sven Lange-Last, Klaus D. Engel, Thom...
The development of the infrastructure for ubiquitous computing is progressing rapidly, yet the applications that will be built on this new infrastructure remain largely ill define...